newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.flags = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.flags = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, lanes) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, lanes) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, lanes) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, lanes, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n }\n\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child, returnFiber);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.flags = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.flags = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, lanes) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, lanes) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, lanes) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, lanes, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n }\n\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child, returnFiber);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.flags = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.flags = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, lanes) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, lanes) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, lanes) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, lanes, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n }\n\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child, returnFiber);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.flags = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.flags = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, lanes) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, lanes) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, lanes) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, lanes, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n }\n\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child, returnFiber);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.flags = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.flags = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, lanes) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, lanes) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, lanes) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, lanes, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n }\n\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child, returnFiber);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.flags = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.flags = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, lanes) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, lanes) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, lanes) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, lanes, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n }\n\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child, returnFiber);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.flags = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.flags = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, lanes) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, lanes) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, lanes) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, lanes, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n }\n\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child, returnFiber);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.flags = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.flags = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.flags = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, lanes) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, lanes) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, lanes) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, lanes, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\n }\n\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child, returnFiber);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\n\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType(returnFiber);\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case Block:\n case FunctionComponent:\n case ForwardRef:\n case SimpleMemoComponent:\n {\n {\n {\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n hotCompareElements(current.elementType, element.type, hotUpdateChild(current), current.type) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n hotCompareElements(child.elementType, element.type, hotUpdateChild(child), child.type) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n } // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n\n\n var last = returnFiber.lastEffect;\n\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n\n\n var childToDelete = currentFirstChild;\n\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n // instead.\n var existingChildren = new Map();\n var existingChild = currentFirstChild;\n\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n\n existingChild = existingChild.sibling;\n }\n\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n\n var current = newFiber.alternate;\n\n if (current !== null) {\n var oldIndex = current.index;\n\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null) {\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current, element) )) {\n // Move based on index\n var existing = useFiber(current, element.props);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n } // Insert\n\n\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || []);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n /**\n * Warns if there is a duplicate or missing key\n */\n\n\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n\n if (typeof key !== 'string') {\n break;\n }\n\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n\n break;\n }\n }\n\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n {\n // First, validate keys.\n var knownKeys = null;\n\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n\n if (_newFiber === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n\n previousNewFiber = _newFiber;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n var iteratorFn = getIteratorFn(newChildrenIterable);\n\n if (!(typeof iteratorFn === 'function')) {\n {\n throw Error( \"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\" );\n }\n }\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n if (!didWarnAboutGenerators) {\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\n }\n\n didWarnAboutGenerators = true;\n } // Warn about using Maps as children\n\n\n if (newChildrenIterable.entries === iteratorFn) {\n if (!didWarnAboutMaps) {\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\n }\n\n didWarnAboutMaps = true;\n } // First, validate keys.\n // We'll get a different iterator later for the main pass.\n\n\n var _newChildren = iteratorFn.call(newChildrenIterable);\n\n if (_newChildren) {\n var knownKeys = null;\n\n var _step = _newChildren.next();\n\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n\n if (!(newChildren != null)) {\n {\n throw Error( \"An iterable object provided no iterator.\" );\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n var step = newChildren.next();\n\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n\n break;\n }\n\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n\n if (_newFiber3 === null) {\n continue;\n }\n\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n\n previousNewFiber = _newFiber3;\n }\n\n return resultingFirstChild;\n } // Add all children to a key map for quick lookups.\n\n\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\n\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent);\n existing.return = returnFiber;\n return existing;\n } // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n\n\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n switch (child.tag) {\n case Fragment:\n {\n if (element.type === REACT_FRAGMENT_TYPE) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.props.children);\n existing.return = returnFiber;\n\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n\n return existing;\n }\n\n break;\n }\n\n case Block:\n\n // We intentionally fallthrough here if enableBlocksAPI is not on.\n // eslint-disable-next-lined no-fallthrough\n\n default:\n {\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element) )) {\n deleteRemainingChildren(returnFiber, child.sibling);\n\n var _existing3 = useFiber(child, element.props);\n\n _existing3.ref = coerceRef(returnFiber, child, element);\n _existing3.return = returnFiber;\n\n {\n _existing3._debugSource = element._source;\n _existing3._debugOwner = element._owner;\n }\n\n return _existing3;\n }\n\n break;\n }\n } // Didn't match.\n\n\n deleteRemainingChildren(returnFiber, child);\n break;\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || []);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n\n\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n } // Handle object types\n\n\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n\n {\n {\n throw Error( (Component.displayName || Component.name || 'Component') + \"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\" );\n }\n }\n }\n }\n } // Remaining cases are all treated as empty.\n\n\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$7()) : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.type === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n case ClassComponentLazy:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created['return'] = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4['return'] = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created['return'] = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2()) : void 0;\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4['return'] = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created['return'] = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4['return'] = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created['return'] = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2()) : void 0;\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4['return'] = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.type === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n case ClassComponentLazy:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$7()) : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.type === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n case ClassComponentLazy:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n created.ref = coerceRef(current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updateCall(returnFiber, current, call, expirationTime) {\n // TODO: Should this also compare handler to determine whether to reuse?\n if (current === null || current.tag !== CallComponent) {\n // Insert\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\n if (current === null || current.tag !== ReturnComponent) {\n // Insert\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n } else {\n // Move based on index\n var existing = useFiber(current, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\n _created['return'] = returnFiber;\n return _created;\n } else {\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\n _created2.ref = coerceRef(null, newChild);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n case REACT_RETURN_TYPE:\n {\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\n _created4.type = newChild.value;\n _created4['return'] = returnFiber;\n return _created4;\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\n _created5['return'] = returnFiber;\n return _created5;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\n _created6['return'] = returnFiber;\n return _created6;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_CALL_TYPE:\n {\n if (newChild.key === key) {\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a\n // yield.\n if (key === null) {\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n\n case REACT_CALL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n\n case REACT_RETURN_TYPE:\n {\n // Returns don't have keys, so we neither have to check the old nor\n // new node for the key. If both are returns, they match.\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\n }\n\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_CALL_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\n _created7.ref = coerceRef(currentFirstChild, element);\n _created7['return'] = returnFiber;\n return _created7;\n }\n }\n\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\n var key = call.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === CallComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, call, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\n // There's no need to check for keys on yields since they're stateless.\n var child = currentFirstChild;\n if (child !== null) {\n if (child.tag === ReturnComponent) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, null, expirationTime);\n existing.type = returnNode.value;\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n }\n }\n\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\n created.type = returnNode.value;\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created['return'] = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2()) : void 0;\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4['return'] = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created['return'] = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created['return'] = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created['return'] = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2['return'] = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3['return'] = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (typeof newChildrenIterable.entries === 'function') {\n var possibleMap = newChildrenIterable;\n if (possibleMap.entries === iteratorFn) {\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2());\n didWarnAboutMaps = true;\n }\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing['return'] = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing['return'] = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created['return'] = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4['return'] = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing['return'] = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created['return'] = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current = newFiber.alternate;\n if (current !== null) {\n var oldIndex = current.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\n if (current === null || current.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current, element, expirationTime) {\n if (current !== null && current.type === element.type) {\n // Move based on index\n var existing = useFiber(current, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current, portal, expirationTime) {\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\n if (current === null || current.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$7()) : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && (current$$1.elementType === element.type || (\n // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(current$$1, element)))) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (_newFiber === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n (function () {\n if (!(typeof iteratorFn === 'function')) {\n {\n throw ReactError(Error('An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.'));\n }\n }\n })();\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n (function () {\n if (!(newChildren != null)) {\n {\n throw ReactError(Error('An iterable object provided no iterator.'));\n }\n }\n })();\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type || (\n // Keep this check inline so it only runs on the false path:\n isCompatibleFamilyForHotReloading(child, element))) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n (function () {\n {\n {\n throw ReactError(Error((Component.displayName || Component.name || 'Component') + '(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.'));\n }\n }\n })();\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}","function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return;\n }\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's effect list is empty except for\n // deletions, so we can just append the deletion to the list. The remaining\n // effects aren't added until the complete phase. Once we implement\n // resuming, this may not be true.\n var last = returnFiber.lastEffect;\n if (last !== null) {\n last.nextEffect = childToDelete;\n returnFiber.lastEffect = childToDelete;\n } else {\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\n }\n childToDelete.nextEffect = null;\n childToDelete.effectTag = Deletion;\n }\n\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\n if (!shouldTrackSideEffects) {\n // Noop.\n return null;\n }\n\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\n // assuming that after the first child we've already added everything.\n var childToDelete = currentFirstChild;\n while (childToDelete !== null) {\n deleteChild(returnFiber, childToDelete);\n childToDelete = childToDelete.sibling;\n }\n return null;\n }\n\n function mapRemainingChildren(returnFiber, currentFirstChild) {\n // Add the remaining children to a temporary map so that we can find them by\n // keys quickly. Implicit (null) keys get added to this set with their index\n var existingChildren = new Map();\n\n var existingChild = currentFirstChild;\n while (existingChild !== null) {\n if (existingChild.key !== null) {\n existingChildren.set(existingChild.key, existingChild);\n } else {\n existingChildren.set(existingChild.index, existingChild);\n }\n existingChild = existingChild.sibling;\n }\n return existingChildren;\n }\n\n function useFiber(fiber, pendingProps, expirationTime) {\n // We currently set sibling to null and index to 0 here because it is easy\n // to forget to do before returning it. E.g. for the single child case.\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\n clone.index = 0;\n clone.sibling = null;\n return clone;\n }\n\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\n newFiber.index = newIndex;\n if (!shouldTrackSideEffects) {\n // Noop.\n return lastPlacedIndex;\n }\n var current$$1 = newFiber.alternate;\n if (current$$1 !== null) {\n var oldIndex = current$$1.index;\n if (oldIndex < lastPlacedIndex) {\n // This is a move.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n } else {\n // This item can stay in place.\n return oldIndex;\n }\n } else {\n // This is an insertion.\n newFiber.effectTag = Placement;\n return lastPlacedIndex;\n }\n }\n\n function placeSingleChild(newFiber) {\n // This is simpler for the single child case. We only need to do a\n // placement for inserting new children.\n if (shouldTrackSideEffects && newFiber.alternate === null) {\n newFiber.effectTag = Placement;\n }\n return newFiber;\n }\n\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostText) {\n // Insert\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateElement(returnFiber, current$$1, element, expirationTime) {\n if (current$$1 !== null && current$$1.elementType === element.type) {\n // Move based on index\n var existing = useFiber(current$$1, element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, current$$1, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n // Insert\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\n created.ref = coerceRef(returnFiber, current$$1, element);\n created.return = returnFiber;\n return created;\n }\n }\n\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\n // Insert\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\n if (current$$1 === null || current$$1.tag !== Fragment) {\n // Insert\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\n created.return = returnFiber;\n return created;\n } else {\n // Update\n var existing = useFiber(current$$1, fragment, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n }\n\n function createChild(returnFiber, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\n _created.ref = coerceRef(returnFiber, null, newChild);\n _created.return = returnFiber;\n return _created;\n }\n case REACT_PORTAL_TYPE:\n {\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\n _created2.return = returnFiber;\n return _created2;\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\n _created3.return = returnFiber;\n return _created3;\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\n // Update the fiber if the keys match, otherwise return null.\n\n var key = oldFiber !== null ? oldFiber.key : null;\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys. If the previous node is implicitly keyed\n // we can continue to replace it without aborting even if it is not a text\n // node.\n if (key !== null) {\n return null;\n }\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n if (newChild.key === key) {\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\n }\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n case REACT_PORTAL_TYPE:\n {\n if (newChild.key === key) {\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\n } else {\n return null;\n }\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n if (key !== null) {\n return null;\n }\n\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n // Text nodes don't have keys, so we neither have to check the old nor\n // new node for the key. If both are text nodes, they match.\n var matchedFiber = existingChildren.get(newIdx) || null;\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\n }\n\n if (typeof newChild === 'object' && newChild !== null) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n {\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n if (newChild.type === REACT_FRAGMENT_TYPE) {\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\n }\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\n }\n case REACT_PORTAL_TYPE:\n {\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\n }\n }\n\n if (isArray(newChild) || getIteratorFn(newChild)) {\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\n }\n\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n\n return null;\n }\n\n /**\n * Warns if there is a duplicate or missing key\n */\n function warnOnInvalidKey(child, knownKeys) {\n {\n if (typeof child !== 'object' || child === null) {\n return knownKeys;\n }\n switch (child.$$typeof) {\n case REACT_ELEMENT_TYPE:\n case REACT_PORTAL_TYPE:\n warnForMissingKey(child);\n var key = child.key;\n if (typeof key !== 'string') {\n break;\n }\n if (knownKeys === null) {\n knownKeys = new Set();\n knownKeys.add(key);\n break;\n }\n if (!knownKeys.has(key)) {\n knownKeys.add(key);\n break;\n }\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\n break;\n default:\n break;\n }\n }\n return knownKeys;\n }\n\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n // This algorithm can't optimize by searching from both ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n\n {\n // First, validate keys.\n var knownKeys = null;\n for (var i = 0; i < newChildren.length; i++) {\n var child = newChildren[i];\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (oldFiber === null) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (newIdx === newChildren.length) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n if (!_newFiber) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber;\n } else {\n previousNewFiber.sibling = _newFiber;\n }\n previousNewFiber = _newFiber;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n if (_newFiber2) {\n if (shouldTrackSideEffects) {\n if (_newFiber2.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber2;\n } else {\n previousNewFiber.sibling = _newFiber2;\n }\n previousNewFiber = _newFiber2;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\n // This is the same implementation as reconcileChildrenArray(),\n // but using the iterator instead.\n\n var iteratorFn = getIteratorFn(newChildrenIterable);\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\n\n {\n // We don't support rendering Generators because it's a mutation.\n // See https://github.com/facebook/react/issues/12995\n if (typeof Symbol === 'function' &&\n // $FlowFixMe Flow doesn't know about toStringTag\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\n didWarnAboutGenerators = true;\n }\n\n // Warn about using Maps as children\n if (newChildrenIterable.entries === iteratorFn) {\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\n didWarnAboutMaps = true;\n }\n\n // First, validate keys.\n // We'll get a different iterator later for the main pass.\n var _newChildren = iteratorFn.call(newChildrenIterable);\n if (_newChildren) {\n var knownKeys = null;\n var _step = _newChildren.next();\n for (; !_step.done; _step = _newChildren.next()) {\n var child = _step.value;\n knownKeys = warnOnInvalidKey(child, knownKeys);\n }\n }\n }\n\n var newChildren = iteratorFn.call(newChildrenIterable);\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\n\n var resultingFirstChild = null;\n var previousNewFiber = null;\n\n var oldFiber = currentFirstChild;\n var lastPlacedIndex = 0;\n var newIdx = 0;\n var nextOldFiber = null;\n\n var step = newChildren.next();\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\n if (oldFiber.index > newIdx) {\n nextOldFiber = oldFiber;\n oldFiber = null;\n } else {\n nextOldFiber = oldFiber.sibling;\n }\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\n if (newFiber === null) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n if (!oldFiber) {\n oldFiber = nextOldFiber;\n }\n break;\n }\n if (shouldTrackSideEffects) {\n if (oldFiber && newFiber.alternate === null) {\n // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber);\n }\n }\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber;\n } else {\n // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber;\n }\n previousNewFiber = newFiber;\n oldFiber = nextOldFiber;\n }\n\n if (step.done) {\n // We've reached the end of the new children. We can delete the rest.\n deleteRemainingChildren(returnFiber, oldFiber);\n return resultingFirstChild;\n }\n\n if (oldFiber === null) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\n if (_newFiber3 === null) {\n continue;\n }\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber3;\n } else {\n previousNewFiber.sibling = _newFiber3;\n }\n previousNewFiber = _newFiber3;\n }\n return resultingFirstChild;\n }\n\n // Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\n\n // Keep scanning and use the map to restore deleted items as moves.\n for (; !step.done; newIdx++, step = newChildren.next()) {\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\n if (_newFiber4 !== null) {\n if (shouldTrackSideEffects) {\n if (_newFiber4.alternate !== null) {\n // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\n }\n }\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\n if (previousNewFiber === null) {\n resultingFirstChild = _newFiber4;\n } else {\n previousNewFiber.sibling = _newFiber4;\n }\n previousNewFiber = _newFiber4;\n }\n }\n\n if (shouldTrackSideEffects) {\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n existingChildren.forEach(function (child) {\n return deleteChild(returnFiber, child);\n });\n }\n\n return resultingFirstChild;\n }\n\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\n // There's no need to check for keys on text nodes since we don't have a\n // way to define them.\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\n // We already have an existing node so let's just update it and delete\n // the rest.\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\n existing.return = returnFiber;\n return existing;\n }\n // The existing first child is not a text node so we need to create one\n // and delete the existing ones.\n deleteRemainingChildren(returnFiber, currentFirstChild);\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\n var key = element.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\n existing.ref = coerceRef(returnFiber, child, element);\n existing.return = returnFiber;\n {\n existing._debugSource = element._source;\n existing._debugOwner = element._owner;\n }\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n if (element.type === REACT_FRAGMENT_TYPE) {\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\n created.return = returnFiber;\n return created;\n } else {\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\n _created4.return = returnFiber;\n return _created4;\n }\n }\n\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\n var key = portal.key;\n var child = currentFirstChild;\n while (child !== null) {\n // TODO: If key === null and child.key === null, then this only applies to\n // the first item in the list.\n if (child.key === key) {\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\n deleteRemainingChildren(returnFiber, child.sibling);\n var existing = useFiber(child, portal.children || [], expirationTime);\n existing.return = returnFiber;\n return existing;\n } else {\n deleteRemainingChildren(returnFiber, child);\n break;\n }\n } else {\n deleteChild(returnFiber, child);\n }\n child = child.sibling;\n }\n\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\n created.return = returnFiber;\n return created;\n }\n\n // This API will tag the children with the side-effect of the reconciliation\n // itself. They will be added to the side-effect list as we pass through the\n // children and the parent.\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\n if (isUnkeyedTopLevelFragment) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }\n\n return reconcileChildFibers;\n}"],"string":"[\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) // Noop.\\n return;\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) // Noop.\\n return null;\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while(childToDelete !== null){\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n while(existingChild !== null){\\n if (existingChild.key !== null) existingChildren.set(existingChild.key, existingChild);\\n else existingChildren.set(existingChild.index, existingChild);\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) // Noop.\\n return lastPlacedIndex;\\n var current3 = newFiber.alternate;\\n if (current3 !== null) {\\n var oldIndex = current3.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else // This item can stay in place.\\n return oldIndex;\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) newFiber.flags = Placement;\\n return newFiber;\\n }\\n function updateTextNode(returnFiber, current3, textContent, lanes) {\\n if (current3 === null || current3.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current3, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n function updateElement(returnFiber, current3, element, lanes) {\\n if (current3 !== null) {\\n if (current3.elementType === element.type || isCompatibleFamilyForHotReloading(current3, element)) {\\n // Move based on index\\n var existing = useFiber(current3, element.props);\\n existing.ref = coerceRef(returnFiber, current3, element);\\n existing.return = returnFiber;\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n return existing;\\n }\\n } // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current3, element);\\n created.return = returnFiber;\\n return created;\\n }\\n function updatePortal(returnFiber, current3, portal, lanes) {\\n if (current3 === null || current3.tag !== HostPortal || current3.stateNode.containerInfo !== portal.containerInfo || current3.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current3, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n function updateFragment(returnFiber, current3, fragment, lanes, key) {\\n if (current3 === null || current3.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current3, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch(newChild.$$typeof){\\n case REACT_ELEMENT_TYPE:\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n case REACT_PORTAL_TYPE:\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n if (typeof newChild === 'function') warnOnFunctionType(returnFiber);\\n return null;\\n }\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) return null;\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch(newChild.$$typeof){\\n case REACT_ELEMENT_TYPE:\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else return null;\\n case REACT_PORTAL_TYPE:\\n if (newChild.key === key) return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n else return null;\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) return null;\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n if (typeof newChild === 'function') warnOnFunctionType(returnFiber);\\n return null;\\n }\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch(newChild.$$typeof){\\n case REACT_ELEMENT_TYPE:\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n case REACT_PORTAL_TYPE:\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n if (typeof newChild === 'function') warnOnFunctionType(returnFiber);\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */ function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n if (typeof child !== 'object' || child === null) return knownKeys;\\n switch(child.$$typeof){\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n if (typeof key !== 'string') break;\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n error(\\\"Encountered two children with the same key, `%s`. Keys should be unique so that components maintain their identity across updates. Non-unique keys may cause children to be duplicated and/or omitted \\\\u2014 the behavior is unsupported and could change in a future version.\\\", key);\\n break;\\n }\\n return knownKeys;\\n }\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // First, validate keys.\\n var knownKeys = null;\\n for(var i = 0; i < newChildren.length; i++){\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for(; oldFiber !== null && newIdx < newChildren.length; newIdx++){\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else nextOldFiber = oldFiber.sibling;\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) oldFiber = nextOldFiber;\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n else // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for(; newIdx < newChildren.length; newIdx++){\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n if (_newFiber === null) continue;\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n else previousNewFiber.sibling = _newFiber;\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n for(; newIdx < newChildren.length; newIdx++){\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) resultingFirstChild = _newFiber2;\\n else previousNewFiber.sibling = _newFiber2;\\n previousNewFiber = _newFiber2;\\n }\\n }\\n if (shouldTrackSideEffects) // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function(child) {\\n return deleteChild(returnFiber, child);\\n });\\n return resultingFirstChild;\\n }\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n if (!(typeof iteratorFn === 'function')) throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) error(\\\"Using Generators as children is unsupported and will likely yield unexpected results because enumerating a generator mutates it. You may convert it to an array with `Array.from()` or the `[...spread]` operator before rendering. Keep in mind you might need to polyfill these features for older browsers.\\\");\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) error(\\\"Using Maps as children is not supported. Use an array of keyed ReactElements instead.\\\");\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for(; !_step.done; _step = _newChildren.next()){\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n if (!(newChildren != null)) throw Error(\\\"An iterable object provided no iterator.\\\");\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n for(; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()){\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else nextOldFiber = oldFiber.sibling;\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) oldFiber = nextOldFiber;\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n else // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for(; !step.done; newIdx++, step = newChildren.next()){\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n if (_newFiber3 === null) continue;\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n else previousNewFiber.sibling = _newFiber3;\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n for(; !step.done; newIdx++, step = newChildren.next()){\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) resultingFirstChild = _newFiber4;\\n else previousNewFiber.sibling = _newFiber4;\\n previousNewFiber = _newFiber4;\\n }\\n }\\n if (shouldTrackSideEffects) // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function(child) {\\n return deleteChild(returnFiber, child);\\n });\\n return resultingFirstChild;\\n }\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while(child !== null){\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch(child.tag){\\n case Fragment:\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n return existing;\\n }\\n break;\\n case Block:\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n default:\\n if (child.elementType === element.type || isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var _existing3 = useFiber(child, element.props);\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n return _existing3;\\n }\\n break;\\n } // Didn't match.\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else deleteChild(returnFiber, child);\\n child = child.sibling;\\n }\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while(child !== null){\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else deleteChild(returnFiber, child);\\n child = child.sibling;\\n }\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) newChild = newChild.props.children;\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n if (isObject) switch(newChild.$$typeof){\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n }\\n if (typeof newChild === 'string' || typeof newChild === 'number') return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n if (isArray$1(newChild)) return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n if (getIteratorFn(newChild)) return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n if (isObject) throwOnInvalidObjectType(returnFiber, newChild);\\n if (typeof newChild === 'function') warnOnFunctionType(returnFiber);\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch(returnFiber.tag){\\n case ClassComponent:\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) break;\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n throw Error((getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error((getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error((getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error((getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error((getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n {\\n {\\n throw Error((Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n {\\n {\\n throw Error((Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n {\\n {\\n throw Error((Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n {\\n {\\n throw Error((Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n {\\n {\\n throw Error((Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block: // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n {\\n {\\n throw Error((Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$7()) : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current$$1 = newFiber.alternate;\\n\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (!_newFiber) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current$$1 = newFiber.alternate;\\n\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (!_newFiber) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current$$1 = newFiber.alternate;\\n\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (!_newFiber) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n return newFiber;\\n }\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n }\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n if (_newFiber === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n return resultingFirstChild;\\n }\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\");\\n }\\n }\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n didWarnAboutGenerators = true;\\n }\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n didWarnAboutMaps = true;\\n }\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n if (!(newChildren != null)) {\\n {\\n throw Error(\\\"An iterable object provided no iterator.\\\");\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; (newIdx++, step = newChildren.next())) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; (newIdx++, step = newChildren.next())) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; (newIdx++, step = newChildren.next())) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n return resultingFirstChild;\\n }\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n break;\\n }\\n case Block:\\n default:\\n {\\n if (child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var _existing3 = useFiber(child, element.props);\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n return _existing3;\\n }\\n break;\\n }\\n }\\n // Didn't match.\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n }\\n }\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error((getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");\\n }\\n }\\n }\\n }\\n }\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(\\n returnFiber,\\n current,\\n textContent,\\n expirationTime,\\n ) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(\\n textContent,\\n returnFiber.mode,\\n expirationTime,\\n );\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(\\n returnFiber,\\n current,\\n element,\\n expirationTime,\\n ) {\\n if (current !== null) {\\n if (\\n current.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element)\\n ) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n var created = createFiberFromElement(\\n element,\\n returnFiber.mode,\\n expirationTime,\\n );\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(\\n returnFiber,\\n current,\\n portal,\\n expirationTime,\\n ) {\\n if (\\n current === null ||\\n current.tag !== HostPortal ||\\n current.stateNode.containerInfo !== portal.containerInfo ||\\n current.stateNode.implementation !== portal.implementation\\n ) {\\n // Insert\\n var created = createFiberFromPortal(\\n portal,\\n returnFiber.mode,\\n expirationTime,\\n );\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(\\n returnFiber,\\n current,\\n fragment,\\n expirationTime,\\n key,\\n ) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(\\n fragment,\\n returnFiber.mode,\\n expirationTime,\\n key,\\n );\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (\\n typeof newChild === 'string' ||\\n typeof newChild === 'number'\\n ) {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText(\\n '' + newChild,\\n returnFiber.mode,\\n expirationTime,\\n );\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE: {\\n var _created = createFiberFromElement(\\n newChild,\\n returnFiber.mode,\\n expirationTime,\\n );\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE: {\\n var _created2 = createFiberFromPortal(\\n newChild,\\n returnFiber.mode,\\n expirationTime,\\n );\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(\\n newChild,\\n returnFiber.mode,\\n expirationTime,\\n null,\\n );\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(\\n returnFiber,\\n oldFiber,\\n newChild,\\n expirationTime,\\n ) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (\\n typeof newChild === 'string' ||\\n typeof newChild === 'number'\\n ) {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(\\n returnFiber,\\n oldFiber,\\n '' + newChild,\\n expirationTime,\\n );\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE: {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(\\n returnFiber,\\n oldFiber,\\n newChild.props.children,\\n expirationTime,\\n key,\\n );\\n }\\n\\n return updateElement(\\n returnFiber,\\n oldFiber,\\n newChild,\\n expirationTime,\\n );\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE: {\\n if (newChild.key === key) {\\n return updatePortal(\\n returnFiber,\\n oldFiber,\\n newChild,\\n expirationTime,\\n );\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(\\n returnFiber,\\n oldFiber,\\n newChild,\\n expirationTime,\\n null,\\n );\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(\\n existingChildren,\\n returnFiber,\\n newIdx,\\n newChild,\\n expirationTime,\\n ) {\\n if (\\n typeof newChild === 'string' ||\\n typeof newChild === 'number'\\n ) {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(\\n returnFiber,\\n matchedFiber,\\n '' + newChild,\\n expirationTime,\\n );\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE: {\\n var _matchedFiber =\\n existingChildren.get(\\n newChild.key === null ? newIdx : newChild.key,\\n ) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(\\n returnFiber,\\n _matchedFiber,\\n newChild.props.children,\\n expirationTime,\\n newChild.key,\\n );\\n }\\n\\n return updateElement(\\n returnFiber,\\n _matchedFiber,\\n newChild,\\n expirationTime,\\n );\\n }\\n\\n case REACT_PORTAL_TYPE: {\\n var _matchedFiber2 =\\n existingChildren.get(\\n newChild.key === null ? newIdx : newChild.key,\\n ) || null;\\n\\n return updatePortal(\\n returnFiber,\\n _matchedFiber2,\\n newChild,\\n expirationTime,\\n );\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(\\n returnFiber,\\n _matchedFiber3,\\n newChild,\\n expirationTime,\\n null,\\n );\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error(\\n 'Encountered two children with the same key, `%s`. ' +\\n 'Keys should be unique so that components maintain their identity ' +\\n 'across updates. Non-unique keys may cause children to be ' +\\n 'duplicated and/or omitted — the behavior is unsupported and ' +\\n 'could change in a future version.',\\n key,\\n );\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(\\n returnFiber,\\n currentFirstChild,\\n newChildren,\\n expirationTime,\\n ) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (\\n ;\\n oldFiber !== null && newIdx < newChildren.length;\\n newIdx++\\n ) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(\\n returnFiber,\\n oldFiber,\\n newChildren[newIdx],\\n expirationTime,\\n );\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(\\n newFiber,\\n lastPlacedIndex,\\n newIdx,\\n );\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(\\n returnFiber,\\n newChildren[newIdx],\\n expirationTime,\\n );\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(\\n _newFiber,\\n lastPlacedIndex,\\n newIdx,\\n );\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n var existingChildren = mapRemainingChildren(\\n returnFiber,\\n oldFiber,\\n ); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(\\n existingChildren,\\n returnFiber,\\n newIdx,\\n newChildren[newIdx],\\n expirationTime,\\n );\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(\\n _newFiber2.key === null ? newIdx : _newFiber2.key,\\n );\\n }\\n }\\n\\n lastPlacedIndex = placeChild(\\n _newFiber2,\\n lastPlacedIndex,\\n newIdx,\\n );\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function(child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(\\n returnFiber,\\n currentFirstChild,\\n newChildrenIterable,\\n expirationTime,\\n ) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error(\\n 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.',\\n );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (\\n typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator'\\n ) {\\n if (!didWarnAboutGenerators) {\\n error(\\n 'Using Generators as children is unsupported and will likely yield ' +\\n 'unexpected results because enumerating a generator mutates it. ' +\\n 'You may convert it to an array with `Array.from()` or the ' +\\n '`[...spread]` operator before rendering. Keep in mind ' +\\n 'you might need to polyfill these features for older browsers.',\\n );\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error(\\n 'Using Maps as children is unsupported and will likely yield ' +\\n 'unexpected results. Convert it to a sequence/iterable of keyed ' +\\n 'ReactElements instead.',\\n );\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error('An iterable object provided no iterator.');\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (\\n ;\\n oldFiber !== null && !step.done;\\n newIdx++, step = newChildren.next()\\n ) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(\\n returnFiber,\\n oldFiber,\\n step.value,\\n expirationTime,\\n );\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(\\n newFiber,\\n lastPlacedIndex,\\n newIdx,\\n );\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(\\n returnFiber,\\n step.value,\\n expirationTime,\\n );\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(\\n _newFiber3,\\n lastPlacedIndex,\\n newIdx,\\n );\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n var existingChildren = mapRemainingChildren(\\n returnFiber,\\n oldFiber,\\n ); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(\\n existingChildren,\\n returnFiber,\\n newIdx,\\n step.value,\\n expirationTime,\\n );\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(\\n _newFiber4.key === null ? newIdx : _newFiber4.key,\\n );\\n }\\n }\\n\\n lastPlacedIndex = placeChild(\\n _newFiber4,\\n lastPlacedIndex,\\n newIdx,\\n );\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function(child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(\\n returnFiber,\\n currentFirstChild,\\n textContent,\\n expirationTime,\\n ) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (\\n currentFirstChild !== null &&\\n currentFirstChild.tag === HostText\\n ) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(\\n returnFiber,\\n currentFirstChild.sibling,\\n );\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(\\n textContent,\\n returnFiber.mode,\\n expirationTime,\\n );\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(\\n returnFiber,\\n currentFirstChild,\\n element,\\n expirationTime,\\n ) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment: {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(\\n child,\\n element.props.children,\\n );\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default: {\\n if (\\n child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)\\n ) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(\\n returnFiber,\\n child,\\n element,\\n );\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(\\n element.props.children,\\n returnFiber.mode,\\n expirationTime,\\n element.key,\\n );\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(\\n element,\\n returnFiber.mode,\\n expirationTime,\\n );\\n\\n _created4.ref = coerceRef(\\n returnFiber,\\n currentFirstChild,\\n element,\\n );\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(\\n returnFiber,\\n currentFirstChild,\\n portal,\\n expirationTime,\\n ) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (\\n child.tag === HostPortal &&\\n child.stateNode.containerInfo === portal.containerInfo &&\\n child.stateNode.implementation === portal.implementation\\n ) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(\\n portal,\\n returnFiber.mode,\\n expirationTime,\\n );\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n function reconcileChildFibers(\\n returnFiber,\\n currentFirstChild,\\n newChild,\\n expirationTime,\\n ) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment =\\n typeof newChild === 'object' &&\\n newChild !== null &&\\n newChild.type === REACT_FRAGMENT_TYPE &&\\n newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n var isObject =\\n typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(\\n reconcileSingleElement(\\n returnFiber,\\n currentFirstChild,\\n newChild,\\n expirationTime,\\n ),\\n );\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(\\n reconcileSinglePortal(\\n returnFiber,\\n currentFirstChild,\\n newChild,\\n expirationTime,\\n ),\\n );\\n }\\n }\\n\\n if (\\n typeof newChild === 'string' ||\\n typeof newChild === 'number'\\n ) {\\n return placeSingleChild(\\n reconcileSingleTextNode(\\n returnFiber,\\n currentFirstChild,\\n '' + newChild,\\n expirationTime,\\n ),\\n );\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(\\n returnFiber,\\n currentFirstChild,\\n newChild,\\n expirationTime,\\n );\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(\\n returnFiber,\\n currentFirstChild,\\n newChild,\\n expirationTime,\\n );\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (\\n typeof newChild === 'undefined' &&\\n !isUnkeyedTopLevelFragment\\n ) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent: {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent: {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error(\\n (Component.displayName ||\\n Component.name ||\\n 'Component') +\\n '(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.',\\n );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current$$1 = newFiber.alternate;\\n\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && (current$$1.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current$$1, element))) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n (function () {\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw ReactError(Error(\\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\"));\\n }\\n }\\n })();\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n (function () {\\n if (!(newChildren != null)) {\\n {\\n throw ReactError(Error(\\\"An iterable object provided no iterator.\\\"));\\n }\\n }\\n })();\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type || // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element)) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n (function () {\\n {\\n {\\n throw ReactError(Error((Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\"));\\n }\\n }\\n })();\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n\\t function deleteChild(returnFiber, childToDelete) {\\n\\t if (!shouldTrackSideEffects) {\\n\\t // Noop.\\n\\t return;\\n\\t }\\n\\t // Deletions are added in reversed order so we add it to the front.\\n\\t // At this point, the return fiber's effect list is empty except for\\n\\t // deletions, so we can just append the deletion to the list. The remaining\\n\\t // effects aren't added until the complete phase. Once we implement\\n\\t // resuming, this may not be true.\\n\\t var last = returnFiber.lastEffect;\\n\\t if (last !== null) {\\n\\t last.nextEffect = childToDelete;\\n\\t returnFiber.lastEffect = childToDelete;\\n\\t } else {\\n\\t returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n\\t }\\n\\t childToDelete.nextEffect = null;\\n\\t childToDelete.effectTag = Deletion;\\n\\t }\\n\\t\\n\\t function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n\\t if (!shouldTrackSideEffects) {\\n\\t // Noop.\\n\\t return null;\\n\\t }\\n\\t\\n\\t // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n\\t // assuming that after the first child we've already added everything.\\n\\t var childToDelete = currentFirstChild;\\n\\t while (childToDelete !== null) {\\n\\t deleteChild(returnFiber, childToDelete);\\n\\t childToDelete = childToDelete.sibling;\\n\\t }\\n\\t return null;\\n\\t }\\n\\t\\n\\t function mapRemainingChildren(returnFiber, currentFirstChild) {\\n\\t // Add the remaining children to a temporary map so that we can find them by\\n\\t // keys quickly. Implicit (null) keys get added to this set with their index\\n\\t var existingChildren = new Map();\\n\\t\\n\\t var existingChild = currentFirstChild;\\n\\t while (existingChild !== null) {\\n\\t if (existingChild.key !== null) {\\n\\t existingChildren.set(existingChild.key, existingChild);\\n\\t } else {\\n\\t existingChildren.set(existingChild.index, existingChild);\\n\\t }\\n\\t existingChild = existingChild.sibling;\\n\\t }\\n\\t return existingChildren;\\n\\t }\\n\\t\\n\\t function useFiber(fiber, pendingProps, expirationTime) {\\n\\t // We currently set sibling to null and index to 0 here because it is easy\\n\\t // to forget to do before returning it. E.g. for the single child case.\\n\\t var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n\\t clone.index = 0;\\n\\t clone.sibling = null;\\n\\t return clone;\\n\\t }\\n\\t\\n\\t function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n\\t newFiber.index = newIndex;\\n\\t if (!shouldTrackSideEffects) {\\n\\t // Noop.\\n\\t return lastPlacedIndex;\\n\\t }\\n\\t var current = newFiber.alternate;\\n\\t if (current !== null) {\\n\\t var oldIndex = current.index;\\n\\t if (oldIndex < lastPlacedIndex) {\\n\\t // This is a move.\\n\\t newFiber.effectTag = Placement;\\n\\t return lastPlacedIndex;\\n\\t } else {\\n\\t // This item can stay in place.\\n\\t return oldIndex;\\n\\t }\\n\\t } else {\\n\\t // This is an insertion.\\n\\t newFiber.effectTag = Placement;\\n\\t return lastPlacedIndex;\\n\\t }\\n\\t }\\n\\t\\n\\t function placeSingleChild(newFiber) {\\n\\t // This is simpler for the single child case. We only need to do a\\n\\t // placement for inserting new children.\\n\\t if (shouldTrackSideEffects && newFiber.alternate === null) {\\n\\t newFiber.effectTag = Placement;\\n\\t }\\n\\t return newFiber;\\n\\t }\\n\\t\\n\\t function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n\\t if (current === null || current.tag !== HostText) {\\n\\t // Insert\\n\\t var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t } else {\\n\\t // Update\\n\\t var existing = useFiber(current, textContent, expirationTime);\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t }\\n\\t }\\n\\t\\n\\t function updateElement(returnFiber, current, element, expirationTime) {\\n\\t if (current !== null && current.type === element.type) {\\n\\t // Move based on index\\n\\t var existing = useFiber(current, element.props, expirationTime);\\n\\t existing.ref = coerceRef(current, element);\\n\\t existing['return'] = returnFiber;\\n\\t {\\n\\t existing._debugSource = element._source;\\n\\t existing._debugOwner = element._owner;\\n\\t }\\n\\t return existing;\\n\\t } else {\\n\\t // Insert\\n\\t var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n\\t created.ref = coerceRef(current, element);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t }\\n\\t }\\n\\t\\n\\t function updateCall(returnFiber, current, call, expirationTime) {\\n\\t // TODO: Should this also compare handler to determine whether to reuse?\\n\\t if (current === null || current.tag !== CallComponent) {\\n\\t // Insert\\n\\t var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t } else {\\n\\t // Move based on index\\n\\t var existing = useFiber(current, call, expirationTime);\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t }\\n\\t }\\n\\t\\n\\t function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n\\t if (current === null || current.tag !== ReturnComponent) {\\n\\t // Insert\\n\\t var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n\\t created.type = returnNode.value;\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t } else {\\n\\t // Move based on index\\n\\t var existing = useFiber(current, null, expirationTime);\\n\\t existing.type = returnNode.value;\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t }\\n\\t }\\n\\t\\n\\t function updatePortal(returnFiber, current, portal, expirationTime) {\\n\\t if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n\\t // Insert\\n\\t var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t } else {\\n\\t // Update\\n\\t var existing = useFiber(current, portal.children || [], expirationTime);\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t }\\n\\t }\\n\\t\\n\\t function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n\\t if (current === null || current.tag !== Fragment) {\\n\\t // Insert\\n\\t var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t } else {\\n\\t // Update\\n\\t var existing = useFiber(current, fragment, expirationTime);\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t }\\n\\t }\\n\\t\\n\\t function createChild(returnFiber, newChild, expirationTime) {\\n\\t if (typeof newChild === 'string' || typeof newChild === 'number') {\\n\\t // Text nodes don't have keys. If the previous node is implicitly keyed\\n\\t // we can continue to replace it without aborting even if it is not a text\\n\\t // node.\\n\\t var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t }\\n\\t\\n\\t if (typeof newChild === 'object' && newChild !== null) {\\n\\t switch (newChild.$$typeof) {\\n\\t case REACT_ELEMENT_TYPE:\\n\\t {\\n\\t if (newChild.type === REACT_FRAGMENT_TYPE) {\\n\\t var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n\\t _created['return'] = returnFiber;\\n\\t return _created;\\n\\t } else {\\n\\t var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n\\t _created2.ref = coerceRef(null, newChild);\\n\\t _created2['return'] = returnFiber;\\n\\t return _created2;\\n\\t }\\n\\t }\\n\\t\\n\\t case REACT_CALL_TYPE:\\n\\t {\\n\\t var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n\\t _created3['return'] = returnFiber;\\n\\t return _created3;\\n\\t }\\n\\t\\n\\t case REACT_RETURN_TYPE:\\n\\t {\\n\\t var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n\\t _created4.type = newChild.value;\\n\\t _created4['return'] = returnFiber;\\n\\t return _created4;\\n\\t }\\n\\t\\n\\t case REACT_PORTAL_TYPE:\\n\\t {\\n\\t var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n\\t _created5['return'] = returnFiber;\\n\\t return _created5;\\n\\t }\\n\\t }\\n\\t\\n\\t if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n\\t var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n\\t _created6['return'] = returnFiber;\\n\\t return _created6;\\n\\t }\\n\\t\\n\\t throwOnInvalidObjectType(returnFiber, newChild);\\n\\t }\\n\\t\\n\\t {\\n\\t if (typeof newChild === 'function') {\\n\\t warnOnFunctionType();\\n\\t }\\n\\t }\\n\\t\\n\\t return null;\\n\\t }\\n\\t\\n\\t function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n\\t // Update the fiber if the keys match, otherwise return null.\\n\\t\\n\\t var key = oldFiber !== null ? oldFiber.key : null;\\n\\t\\n\\t if (typeof newChild === 'string' || typeof newChild === 'number') {\\n\\t // Text nodes don't have keys. If the previous node is implicitly keyed\\n\\t // we can continue to replace it without aborting even if it is not a text\\n\\t // node.\\n\\t if (key !== null) {\\n\\t return null;\\n\\t }\\n\\t return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n\\t }\\n\\t\\n\\t if (typeof newChild === 'object' && newChild !== null) {\\n\\t switch (newChild.$$typeof) {\\n\\t case REACT_ELEMENT_TYPE:\\n\\t {\\n\\t if (newChild.key === key) {\\n\\t if (newChild.type === REACT_FRAGMENT_TYPE) {\\n\\t return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n\\t }\\n\\t return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n\\t } else {\\n\\t return null;\\n\\t }\\n\\t }\\n\\t\\n\\t case REACT_CALL_TYPE:\\n\\t {\\n\\t if (newChild.key === key) {\\n\\t return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n\\t } else {\\n\\t return null;\\n\\t }\\n\\t }\\n\\t\\n\\t case REACT_RETURN_TYPE:\\n\\t {\\n\\t // Returns don't have keys. If the previous node is implicitly keyed\\n\\t // we can continue to replace it without aborting even if it is not a\\n\\t // yield.\\n\\t if (key === null) {\\n\\t return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n\\t } else {\\n\\t return null;\\n\\t }\\n\\t }\\n\\t\\n\\t case REACT_PORTAL_TYPE:\\n\\t {\\n\\t if (newChild.key === key) {\\n\\t return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n\\t } else {\\n\\t return null;\\n\\t }\\n\\t }\\n\\t }\\n\\t\\n\\t if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n\\t if (key !== null) {\\n\\t return null;\\n\\t }\\n\\t\\n\\t return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n\\t }\\n\\t\\n\\t throwOnInvalidObjectType(returnFiber, newChild);\\n\\t }\\n\\t\\n\\t {\\n\\t if (typeof newChild === 'function') {\\n\\t warnOnFunctionType();\\n\\t }\\n\\t }\\n\\t\\n\\t return null;\\n\\t }\\n\\t\\n\\t function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n\\t if (typeof newChild === 'string' || typeof newChild === 'number') {\\n\\t // Text nodes don't have keys, so we neither have to check the old nor\\n\\t // new node for the key. If both are text nodes, they match.\\n\\t var matchedFiber = existingChildren.get(newIdx) || null;\\n\\t return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n\\t }\\n\\t\\n\\t if (typeof newChild === 'object' && newChild !== null) {\\n\\t switch (newChild.$$typeof) {\\n\\t case REACT_ELEMENT_TYPE:\\n\\t {\\n\\t var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\t if (newChild.type === REACT_FRAGMENT_TYPE) {\\n\\t return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n\\t }\\n\\t return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n\\t }\\n\\t\\n\\t case REACT_CALL_TYPE:\\n\\t {\\n\\t var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\t return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n\\t }\\n\\t\\n\\t case REACT_RETURN_TYPE:\\n\\t {\\n\\t // Returns don't have keys, so we neither have to check the old nor\\n\\t // new node for the key. If both are returns, they match.\\n\\t var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\t return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n\\t }\\n\\t\\n\\t case REACT_PORTAL_TYPE:\\n\\t {\\n\\t var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\t return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n\\t }\\n\\t }\\n\\t\\n\\t if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n\\t var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n\\t return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n\\t }\\n\\t\\n\\t throwOnInvalidObjectType(returnFiber, newChild);\\n\\t }\\n\\t\\n\\t {\\n\\t if (typeof newChild === 'function') {\\n\\t warnOnFunctionType();\\n\\t }\\n\\t }\\n\\t\\n\\t return null;\\n\\t }\\n\\t\\n\\t /**\\n\\t * Warns if there is a duplicate or missing key\\n\\t */\\n\\t function warnOnInvalidKey(child, knownKeys) {\\n\\t {\\n\\t if (typeof child !== 'object' || child === null) {\\n\\t return knownKeys;\\n\\t }\\n\\t switch (child.$$typeof) {\\n\\t case REACT_ELEMENT_TYPE:\\n\\t case REACT_CALL_TYPE:\\n\\t case REACT_PORTAL_TYPE:\\n\\t warnForMissingKey(child);\\n\\t var key = child.key;\\n\\t if (typeof key !== 'string') {\\n\\t break;\\n\\t }\\n\\t if (knownKeys === null) {\\n\\t knownKeys = new Set();\\n\\t knownKeys.add(key);\\n\\t break;\\n\\t }\\n\\t if (!knownKeys.has(key)) {\\n\\t knownKeys.add(key);\\n\\t break;\\n\\t }\\n\\t warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n\\t break;\\n\\t default:\\n\\t break;\\n\\t }\\n\\t }\\n\\t return knownKeys;\\n\\t }\\n\\t\\n\\t function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n\\t // This algorithm can't optimize by searching from boths ends since we\\n\\t // don't have backpointers on fibers. I'm trying to see how far we can get\\n\\t // with that model. If it ends up not being worth the tradeoffs, we can\\n\\t // add it later.\\n\\t\\n\\t // Even with a two ended optimization, we'd want to optimize for the case\\n\\t // where there are few changes and brute force the comparison instead of\\n\\t // going for the Map. It'd like to explore hitting that path first in\\n\\t // forward-only mode and only go for the Map once we notice that we need\\n\\t // lots of look ahead. This doesn't handle reversal as well as two ended\\n\\t // search but that's unusual. Besides, for the two ended optimization to\\n\\t // work on Iterables, we'd need to copy the whole set.\\n\\t\\n\\t // In this first iteration, we'll just live with hitting the bad case\\n\\t // (adding everything to a Map) in for every insert/move.\\n\\t\\n\\t // If you change this code, also update reconcileChildrenIterator() which\\n\\t // uses the same algorithm.\\n\\t\\n\\t {\\n\\t // First, validate keys.\\n\\t var knownKeys = null;\\n\\t for (var i = 0; i < newChildren.length; i++) {\\n\\t var child = newChildren[i];\\n\\t knownKeys = warnOnInvalidKey(child, knownKeys);\\n\\t }\\n\\t }\\n\\t\\n\\t var resultingFirstChild = null;\\n\\t var previousNewFiber = null;\\n\\t\\n\\t var oldFiber = currentFirstChild;\\n\\t var lastPlacedIndex = 0;\\n\\t var newIdx = 0;\\n\\t var nextOldFiber = null;\\n\\t for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n\\t if (oldFiber.index > newIdx) {\\n\\t nextOldFiber = oldFiber;\\n\\t oldFiber = null;\\n\\t } else {\\n\\t nextOldFiber = oldFiber.sibling;\\n\\t }\\n\\t var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\t if (newFiber === null) {\\n\\t // TODO: This breaks on empty slots like null children. That's\\n\\t // unfortunate because it triggers the slow path all the time. We need\\n\\t // a better way to communicate whether this was a miss or null,\\n\\t // boolean, undefined, etc.\\n\\t if (oldFiber === null) {\\n\\t oldFiber = nextOldFiber;\\n\\t }\\n\\t break;\\n\\t }\\n\\t if (shouldTrackSideEffects) {\\n\\t if (oldFiber && newFiber.alternate === null) {\\n\\t // We matched the slot, but we didn't reuse the existing fiber, so we\\n\\t // need to delete the existing child.\\n\\t deleteChild(returnFiber, oldFiber);\\n\\t }\\n\\t }\\n\\t lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\t if (previousNewFiber === null) {\\n\\t // TODO: Move out of the loop. This only happens for the first run.\\n\\t resultingFirstChild = newFiber;\\n\\t } else {\\n\\t // TODO: Defer siblings if we're not at the right index for this slot.\\n\\t // I.e. if we had null values before, then we want to defer this\\n\\t // for each null value. However, we also don't want to call updateSlot\\n\\t // with the previous one.\\n\\t previousNewFiber.sibling = newFiber;\\n\\t }\\n\\t previousNewFiber = newFiber;\\n\\t oldFiber = nextOldFiber;\\n\\t }\\n\\t\\n\\t if (newIdx === newChildren.length) {\\n\\t // We've reached the end of the new children. We can delete the rest.\\n\\t deleteRemainingChildren(returnFiber, oldFiber);\\n\\t return resultingFirstChild;\\n\\t }\\n\\t\\n\\t if (oldFiber === null) {\\n\\t // If we don't have any more existing children we can choose a fast path\\n\\t // since the rest will all be insertions.\\n\\t for (; newIdx < newChildren.length; newIdx++) {\\n\\t var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\t if (!_newFiber) {\\n\\t continue;\\n\\t }\\n\\t lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\t if (previousNewFiber === null) {\\n\\t // TODO: Move out of the loop. This only happens for the first run.\\n\\t resultingFirstChild = _newFiber;\\n\\t } else {\\n\\t previousNewFiber.sibling = _newFiber;\\n\\t }\\n\\t previousNewFiber = _newFiber;\\n\\t }\\n\\t return resultingFirstChild;\\n\\t }\\n\\t\\n\\t // Add all children to a key map for quick lookups.\\n\\t var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\t\\n\\t // Keep scanning and use the map to restore deleted items as moves.\\n\\t for (; newIdx < newChildren.length; newIdx++) {\\n\\t var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\t if (_newFiber2) {\\n\\t if (shouldTrackSideEffects) {\\n\\t if (_newFiber2.alternate !== null) {\\n\\t // The new fiber is a work in progress, but if there exists a\\n\\t // current, that means that we reused the fiber. We need to delete\\n\\t // it from the child list so that we don't add it to the deletion\\n\\t // list.\\n\\t existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n\\t }\\n\\t }\\n\\t lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\t if (previousNewFiber === null) {\\n\\t resultingFirstChild = _newFiber2;\\n\\t } else {\\n\\t previousNewFiber.sibling = _newFiber2;\\n\\t }\\n\\t previousNewFiber = _newFiber2;\\n\\t }\\n\\t }\\n\\t\\n\\t if (shouldTrackSideEffects) {\\n\\t // Any existing children that weren't consumed above were deleted. We need\\n\\t // to add them to the deletion list.\\n\\t existingChildren.forEach(function (child) {\\n\\t return deleteChild(returnFiber, child);\\n\\t });\\n\\t }\\n\\t\\n\\t return resultingFirstChild;\\n\\t }\\n\\t\\n\\t function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n\\t // This is the same implementation as reconcileChildrenArray(),\\n\\t // but using the iterator instead.\\n\\t\\n\\t var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\t !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\t\\n\\t {\\n\\t // Warn about using Maps as children\\n\\t if (typeof newChildrenIterable.entries === 'function') {\\n\\t var possibleMap = newChildrenIterable;\\n\\t if (possibleMap.entries === iteratorFn) {\\n\\t warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n\\t didWarnAboutMaps = true;\\n\\t }\\n\\t }\\n\\t\\n\\t // First, validate keys.\\n\\t // We'll get a different iterator later for the main pass.\\n\\t var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\t if (_newChildren) {\\n\\t var knownKeys = null;\\n\\t var _step = _newChildren.next();\\n\\t for (; !_step.done; _step = _newChildren.next()) {\\n\\t var child = _step.value;\\n\\t knownKeys = warnOnInvalidKey(child, knownKeys);\\n\\t }\\n\\t }\\n\\t }\\n\\t\\n\\t var newChildren = iteratorFn.call(newChildrenIterable);\\n\\t !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\t\\n\\t var resultingFirstChild = null;\\n\\t var previousNewFiber = null;\\n\\t\\n\\t var oldFiber = currentFirstChild;\\n\\t var lastPlacedIndex = 0;\\n\\t var newIdx = 0;\\n\\t var nextOldFiber = null;\\n\\t\\n\\t var step = newChildren.next();\\n\\t for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n\\t if (oldFiber.index > newIdx) {\\n\\t nextOldFiber = oldFiber;\\n\\t oldFiber = null;\\n\\t } else {\\n\\t nextOldFiber = oldFiber.sibling;\\n\\t }\\n\\t var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\t if (newFiber === null) {\\n\\t // TODO: This breaks on empty slots like null children. That's\\n\\t // unfortunate because it triggers the slow path all the time. We need\\n\\t // a better way to communicate whether this was a miss or null,\\n\\t // boolean, undefined, etc.\\n\\t if (!oldFiber) {\\n\\t oldFiber = nextOldFiber;\\n\\t }\\n\\t break;\\n\\t }\\n\\t if (shouldTrackSideEffects) {\\n\\t if (oldFiber && newFiber.alternate === null) {\\n\\t // We matched the slot, but we didn't reuse the existing fiber, so we\\n\\t // need to delete the existing child.\\n\\t deleteChild(returnFiber, oldFiber);\\n\\t }\\n\\t }\\n\\t lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\t if (previousNewFiber === null) {\\n\\t // TODO: Move out of the loop. This only happens for the first run.\\n\\t resultingFirstChild = newFiber;\\n\\t } else {\\n\\t // TODO: Defer siblings if we're not at the right index for this slot.\\n\\t // I.e. if we had null values before, then we want to defer this\\n\\t // for each null value. However, we also don't want to call updateSlot\\n\\t // with the previous one.\\n\\t previousNewFiber.sibling = newFiber;\\n\\t }\\n\\t previousNewFiber = newFiber;\\n\\t oldFiber = nextOldFiber;\\n\\t }\\n\\t\\n\\t if (step.done) {\\n\\t // We've reached the end of the new children. We can delete the rest.\\n\\t deleteRemainingChildren(returnFiber, oldFiber);\\n\\t return resultingFirstChild;\\n\\t }\\n\\t\\n\\t if (oldFiber === null) {\\n\\t // If we don't have any more existing children we can choose a fast path\\n\\t // since the rest will all be insertions.\\n\\t for (; !step.done; newIdx++, step = newChildren.next()) {\\n\\t var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\t if (_newFiber3 === null) {\\n\\t continue;\\n\\t }\\n\\t lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\t if (previousNewFiber === null) {\\n\\t // TODO: Move out of the loop. This only happens for the first run.\\n\\t resultingFirstChild = _newFiber3;\\n\\t } else {\\n\\t previousNewFiber.sibling = _newFiber3;\\n\\t }\\n\\t previousNewFiber = _newFiber3;\\n\\t }\\n\\t return resultingFirstChild;\\n\\t }\\n\\t\\n\\t // Add all children to a key map for quick lookups.\\n\\t var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\t\\n\\t // Keep scanning and use the map to restore deleted items as moves.\\n\\t for (; !step.done; newIdx++, step = newChildren.next()) {\\n\\t var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\t if (_newFiber4 !== null) {\\n\\t if (shouldTrackSideEffects) {\\n\\t if (_newFiber4.alternate !== null) {\\n\\t // The new fiber is a work in progress, but if there exists a\\n\\t // current, that means that we reused the fiber. We need to delete\\n\\t // it from the child list so that we don't add it to the deletion\\n\\t // list.\\n\\t existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n\\t }\\n\\t }\\n\\t lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\t if (previousNewFiber === null) {\\n\\t resultingFirstChild = _newFiber4;\\n\\t } else {\\n\\t previousNewFiber.sibling = _newFiber4;\\n\\t }\\n\\t previousNewFiber = _newFiber4;\\n\\t }\\n\\t }\\n\\t\\n\\t if (shouldTrackSideEffects) {\\n\\t // Any existing children that weren't consumed above were deleted. We need\\n\\t // to add them to the deletion list.\\n\\t existingChildren.forEach(function (child) {\\n\\t return deleteChild(returnFiber, child);\\n\\t });\\n\\t }\\n\\t\\n\\t return resultingFirstChild;\\n\\t }\\n\\t\\n\\t function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n\\t // There's no need to check for keys on text nodes since we don't have a\\n\\t // way to define them.\\n\\t if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n\\t // We already have an existing node so let's just update it and delete\\n\\t // the rest.\\n\\t deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n\\t var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t }\\n\\t // The existing first child is not a text node so we need to create one\\n\\t // and delete the existing ones.\\n\\t deleteRemainingChildren(returnFiber, currentFirstChild);\\n\\t var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t }\\n\\t\\n\\t function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n\\t var key = element.key;\\n\\t var child = currentFirstChild;\\n\\t while (child !== null) {\\n\\t // TODO: If key === null and child.key === null, then this only applies to\\n\\t // the first item in the list.\\n\\t if (child.key === key) {\\n\\t if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n\\t deleteRemainingChildren(returnFiber, child.sibling);\\n\\t var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n\\t existing.ref = coerceRef(child, element);\\n\\t existing['return'] = returnFiber;\\n\\t {\\n\\t existing._debugSource = element._source;\\n\\t existing._debugOwner = element._owner;\\n\\t }\\n\\t return existing;\\n\\t } else {\\n\\t deleteRemainingChildren(returnFiber, child);\\n\\t break;\\n\\t }\\n\\t } else {\\n\\t deleteChild(returnFiber, child);\\n\\t }\\n\\t child = child.sibling;\\n\\t }\\n\\t\\n\\t if (element.type === REACT_FRAGMENT_TYPE) {\\n\\t var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t } else {\\n\\t var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n\\t _created7.ref = coerceRef(currentFirstChild, element);\\n\\t _created7['return'] = returnFiber;\\n\\t return _created7;\\n\\t }\\n\\t }\\n\\t\\n\\t function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n\\t var key = call.key;\\n\\t var child = currentFirstChild;\\n\\t while (child !== null) {\\n\\t // TODO: If key === null and child.key === null, then this only applies to\\n\\t // the first item in the list.\\n\\t if (child.key === key) {\\n\\t if (child.tag === CallComponent) {\\n\\t deleteRemainingChildren(returnFiber, child.sibling);\\n\\t var existing = useFiber(child, call, expirationTime);\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t } else {\\n\\t deleteRemainingChildren(returnFiber, child);\\n\\t break;\\n\\t }\\n\\t } else {\\n\\t deleteChild(returnFiber, child);\\n\\t }\\n\\t child = child.sibling;\\n\\t }\\n\\t\\n\\t var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t }\\n\\t\\n\\t function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n\\t // There's no need to check for keys on yields since they're stateless.\\n\\t var child = currentFirstChild;\\n\\t if (child !== null) {\\n\\t if (child.tag === ReturnComponent) {\\n\\t deleteRemainingChildren(returnFiber, child.sibling);\\n\\t var existing = useFiber(child, null, expirationTime);\\n\\t existing.type = returnNode.value;\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t } else {\\n\\t deleteRemainingChildren(returnFiber, child);\\n\\t }\\n\\t }\\n\\t\\n\\t var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n\\t created.type = returnNode.value;\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t }\\n\\t\\n\\t function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n\\t var key = portal.key;\\n\\t var child = currentFirstChild;\\n\\t while (child !== null) {\\n\\t // TODO: If key === null and child.key === null, then this only applies to\\n\\t // the first item in the list.\\n\\t if (child.key === key) {\\n\\t if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n\\t deleteRemainingChildren(returnFiber, child.sibling);\\n\\t var existing = useFiber(child, portal.children || [], expirationTime);\\n\\t existing['return'] = returnFiber;\\n\\t return existing;\\n\\t } else {\\n\\t deleteRemainingChildren(returnFiber, child);\\n\\t break;\\n\\t }\\n\\t } else {\\n\\t deleteChild(returnFiber, child);\\n\\t }\\n\\t child = child.sibling;\\n\\t }\\n\\t\\n\\t var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n\\t created['return'] = returnFiber;\\n\\t return created;\\n\\t }\\n\\t\\n\\t // This API will tag the children with the side-effect of the reconciliation\\n\\t // itself. They will be added to the side-effect list as we pass through the\\n\\t // children and the parent.\\n\\t function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n\\t // This function is not recursive.\\n\\t // If the top level item is an array, we treat it as a set of children,\\n\\t // not as a fragment. Nested arrays on the other hand will be treated as\\n\\t // fragment nodes. Recursion happens at the normal flow.\\n\\t\\n\\t // Handle top level unkeyed fragments as if they were arrays.\\n\\t // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n\\t // We treat the ambiguous cases above the same.\\n\\t if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n\\t newChild = newChild.props.children;\\n\\t }\\n\\t\\n\\t // Handle object types\\n\\t var isObject = typeof newChild === 'object' && newChild !== null;\\n\\t\\n\\t if (isObject) {\\n\\t switch (newChild.$$typeof) {\\n\\t case REACT_ELEMENT_TYPE:\\n\\t return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\t\\n\\t case REACT_CALL_TYPE:\\n\\t return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\t case REACT_RETURN_TYPE:\\n\\t return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\t case REACT_PORTAL_TYPE:\\n\\t return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\t }\\n\\t }\\n\\t\\n\\t if (typeof newChild === 'string' || typeof newChild === 'number') {\\n\\t return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n\\t }\\n\\t\\n\\t if (isArray$1(newChild)) {\\n\\t return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n\\t }\\n\\t\\n\\t if (getIteratorFn(newChild)) {\\n\\t return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n\\t }\\n\\t\\n\\t if (isObject) {\\n\\t throwOnInvalidObjectType(returnFiber, newChild);\\n\\t }\\n\\t\\n\\t {\\n\\t if (typeof newChild === 'function') {\\n\\t warnOnFunctionType();\\n\\t }\\n\\t }\\n\\t if (typeof newChild === 'undefined') {\\n\\t // If the new child is undefined, and the return fiber is a composite\\n\\t // component, throw an error. If Fiber return types are disabled,\\n\\t // we already threw above.\\n\\t switch (returnFiber.tag) {\\n\\t case ClassComponent:\\n\\t {\\n\\t {\\n\\t var instance = returnFiber.stateNode;\\n\\t if (instance.render._isMockFunction) {\\n\\t // We allow auto-mocks to proceed as if they're returning null.\\n\\t break;\\n\\t }\\n\\t }\\n\\t }\\n\\t // Intentionally fall through to the next case, which handles both\\n\\t // functions and classes\\n\\t // eslint-disable-next-lined no-fallthrough\\n\\t case FunctionalComponent:\\n\\t {\\n\\t var Component = returnFiber.type;\\n\\t 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');\\n\\t }\\n\\t }\\n\\t }\\n\\t\\n\\t // Remaining cases are all treated as empty.\\n\\t return deleteRemainingChildren(returnFiber, currentFirstChild);\\n\\t }\\n\\t\\n\\t return reconcileChildFibers;\\n\\t}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n }\\n else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n }\\n else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n }\\n else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n }\\n else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created['return'] = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n }\\n else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n }\\n else {\\n return null;\\n }\\n }\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n }\\n else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n }\\n else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n }\\n else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n }\\n else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n return resultingFirstChild;\\n }\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2()) : void 0;\\n didWarnAboutMaps = true;\\n }\\n }\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n }\\n else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n }\\n else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n }\\n else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n }\\n else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n return resultingFirstChild;\\n }\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n }\\n else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n }\\n else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n }\\n else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n }\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n }\\n else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n return reconcileChildFibers;\\n }\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.flags = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.flags = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.flags = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, lanes) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, lanes) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, lanes);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, lanes) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, lanes, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, lanes, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, lanes);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, lanes);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, lanes, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, lanes) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, lanes, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, lanes);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, lanes) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, lanes);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, lanes, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, lanes);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, lanes);\\n }\\n\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, lanes, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys, returnFiber) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child, returnFiber);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, lanes) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], lanes);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], lanes);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, lanes) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is not supported. ' + 'Use an array of keyed ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys, returnFiber);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, lanes);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, lanes);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, lanes);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, lanes) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, lanes) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, lanes, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, lanes);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, lanes) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, lanes);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, lanes) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, lanes));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, lanes));\\n\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, lanes));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, lanes);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType(returnFiber);\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case Block:\\n case FunctionComponent:\\n case ForwardRef:\\n case SimpleMemoComponent:\\n {\\n {\\n {\\n throw Error( (getComponentName(returnFiber.type) || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n hotCompareElements(current.elementType, element.type, hotUpdateChild(current), current.type) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n hotCompareElements(child.elementType, element.type, hotUpdateChild(child), child.type) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n } // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n\\n\\n var last = returnFiber.lastEffect;\\n\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n } // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n\\n\\n var childToDelete = currentFirstChild;\\n\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n // instead.\\n var existingChildren = new Map();\\n var existingChild = currentFirstChild;\\n\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n\\n existingChild = existingChild.sibling;\\n }\\n\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n\\n var current = newFiber.alternate;\\n\\n if (current !== null) {\\n var oldIndex = current.index;\\n\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null) {\\n if (current.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current, element) )) {\\n // Move based on index\\n var existing = useFiber(current, element.props);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n } // Insert\\n\\n\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n\\n\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n\\n if (typeof key !== 'string') {\\n break;\\n }\\n\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n\\n error('Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n\\n break;\\n }\\n }\\n\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n\\n previousNewFiber = _newFiber;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw Error( \\\"An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.\\\" );\\n }\\n }\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' && // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n if (!didWarnAboutGenerators) {\\n error('Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.');\\n }\\n\\n didWarnAboutGenerators = true;\\n } // Warn about using Maps as children\\n\\n\\n if (newChildrenIterable.entries === iteratorFn) {\\n if (!didWarnAboutMaps) {\\n error('Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.');\\n }\\n\\n didWarnAboutMaps = true;\\n } // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n\\n\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (_newChildren) {\\n var knownKeys = null;\\n\\n var _step = _newChildren.next();\\n\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n\\n if (!(newChildren != null)) {\\n {\\n throw Error( \\\"An iterable object provided no iterator.\\\" );\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n var step = newChildren.next();\\n\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n\\n break;\\n }\\n\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n\\n if (_newFiber3 === null) {\\n continue;\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n\\n previousNewFiber = _newFiber3;\\n }\\n\\n return resultingFirstChild;\\n } // Add all children to a key map for quick lookups.\\n\\n\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); // Keep scanning and use the map to restore deleted items as moves.\\n\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent);\\n existing.return = returnFiber;\\n return existing;\\n } // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n\\n\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n switch (child.tag) {\\n case Fragment:\\n {\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.props.children);\\n existing.return = returnFiber;\\n\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n\\n return existing;\\n }\\n\\n break;\\n }\\n\\n case Block:\\n\\n // We intentionally fallthrough here if enableBlocksAPI is not on.\\n // eslint-disable-next-lined no-fallthrough\\n\\n default:\\n {\\n if (child.elementType === element.type || ( // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element) )) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n\\n var _existing3 = useFiber(child, element.props);\\n\\n _existing3.ref = coerceRef(returnFiber, child, element);\\n _existing3.return = returnFiber;\\n\\n {\\n _existing3._debugSource = element._source;\\n _existing3._debugOwner = element._owner;\\n }\\n\\n return _existing3;\\n }\\n\\n break;\\n }\\n } // Didn't match.\\n\\n\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || []);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n\\n\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n } // Handle object types\\n\\n\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n\\n {\\n {\\n throw Error( (Component.displayName || Component.name || 'Component') + \\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\" );\\n }\\n }\\n }\\n }\\n } // Remaining cases are all treated as empty.\\n\\n\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$7()) : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n case ClassComponentLazy:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created['return'] = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created['return'] = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2()) : void 0;\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created['return'] = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created['return'] = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2()) : void 0;\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n case ClassComponentLazy:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$7()) : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n case ClassComponentLazy:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n created.ref = coerceRef(current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updateCall(returnFiber, current, call, expirationTime) {\\n // TODO: Should this also compare handler to determine whether to reuse?\\n if (current === null || current.tag !== CallComponent) {\\n // Insert\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateReturn(returnFiber, current, returnNode, expirationTime) {\\n if (current === null || current.tag !== ReturnComponent) {\\n // Insert\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Move based on index\\n var existing = useFiber(current, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.internalContextTag, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n var _created = createFiberFromFragment(newChild.props.children, returnFiber.internalContextTag, expirationTime, newChild.key);\\n _created['return'] = returnFiber;\\n return _created;\\n } else {\\n var _created2 = createFiberFromElement(newChild, returnFiber.internalContextTag, expirationTime);\\n _created2.ref = coerceRef(null, newChild);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _created3 = createFiberFromCall(newChild, returnFiber.internalContextTag, expirationTime);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n var _created4 = createFiberFromReturn(newChild, returnFiber.internalContextTag, expirationTime);\\n _created4.type = newChild.value;\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _created5 = createFiberFromPortal(newChild, returnFiber.internalContextTag, expirationTime);\\n _created5['return'] = returnFiber;\\n return _created5;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created6 = createFiberFromFragment(newChild, returnFiber.internalContextTag, expirationTime, null);\\n _created6['return'] = returnFiber;\\n return _created6;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updateCall(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a\\n // yield.\\n if (key === null) {\\n return updateReturn(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n\\n case REACT_CALL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updateCall(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n\\n case REACT_RETURN_TYPE:\\n {\\n // Returns don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are returns, they match.\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateReturn(returnFiber, _matchedFiber3, newChild, expirationTime);\\n }\\n\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber4 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber4, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber5 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber5, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_CALL_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$1());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$1());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.internalContextTag, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created7 = createFiberFromElement(element, returnFiber.internalContextTag, expirationTime);\\n _created7.ref = coerceRef(currentFirstChild, element);\\n _created7['return'] = returnFiber;\\n return _created7;\\n }\\n }\\n\\n function reconcileSingleCall(returnFiber, currentFirstChild, call, expirationTime) {\\n var key = call.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === CallComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, call, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromCall(call, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleReturn(returnFiber, currentFirstChild, returnNode, expirationTime) {\\n // There's no need to check for keys on yields since they're stateless.\\n var child = currentFirstChild;\\n if (child !== null) {\\n if (child.tag === ReturnComponent) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, null, expirationTime);\\n existing.type = returnNode.value;\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n }\\n }\\n\\n var created = createFiberFromReturn(returnNode, returnFiber.internalContextTag, expirationTime);\\n created.type = returnNode.value;\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.internalContextTag, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created['return'] = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2()) : void 0;\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created['return'] = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created['return'] = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2['return'] = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3['return'] = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$2());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (typeof newChildrenIterable.entries === 'function') {\\n var possibleMap = newChildrenIterable;\\n if (possibleMap.entries === iteratorFn) {\\n warning(didWarnAboutMaps, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$2());\\n didWarnAboutMaps = true;\\n }\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren['delete'](_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing['return'] = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created['return'] = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4['return'] = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing['return'] = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created['return'] = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current = newFiber.alternate;\\n if (current !== null) {\\n var oldIndex = current.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current, textContent, expirationTime) {\\n if (current === null || current.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current, element, expirationTime) {\\n if (current !== null && current.type === element.type) {\\n // Move based on index\\n var existing = useFiber(current, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current, portal, expirationTime) {\\n if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current, fragment, expirationTime, key) {\\n if (current === null || current.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray$1(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$7()) : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && (current$$1.elementType === element.type || (\\n // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(current$$1, element)))) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (_newFiber === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n (function () {\\n if (!(typeof iteratorFn === 'function')) {\\n {\\n throw ReactError(Error('An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.'));\\n }\\n }\\n })();\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n (function () {\\n if (!(newChildren != null)) {\\n {\\n throw ReactError(Error('An iterable object provided no iterator.'));\\n }\\n }\\n })();\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type || (\\n // Keep this check inline so it only runs on the false path:\\n isCompatibleFamilyForHotReloading(child, element))) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n (function () {\\n {\\n {\\n throw ReactError(Error((Component.displayName || Component.name || 'Component') + '(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.'));\\n }\\n }\\n })();\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\",\n \"function ChildReconciler(shouldTrackSideEffects) {\\n function deleteChild(returnFiber, childToDelete) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return;\\n }\\n // Deletions are added in reversed order so we add it to the front.\\n // At this point, the return fiber's effect list is empty except for\\n // deletions, so we can just append the deletion to the list. The remaining\\n // effects aren't added until the complete phase. Once we implement\\n // resuming, this may not be true.\\n var last = returnFiber.lastEffect;\\n if (last !== null) {\\n last.nextEffect = childToDelete;\\n returnFiber.lastEffect = childToDelete;\\n } else {\\n returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;\\n }\\n childToDelete.nextEffect = null;\\n childToDelete.effectTag = Deletion;\\n }\\n\\n function deleteRemainingChildren(returnFiber, currentFirstChild) {\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return null;\\n }\\n\\n // TODO: For the shouldClone case, this could be micro-optimized a bit by\\n // assuming that after the first child we've already added everything.\\n var childToDelete = currentFirstChild;\\n while (childToDelete !== null) {\\n deleteChild(returnFiber, childToDelete);\\n childToDelete = childToDelete.sibling;\\n }\\n return null;\\n }\\n\\n function mapRemainingChildren(returnFiber, currentFirstChild) {\\n // Add the remaining children to a temporary map so that we can find them by\\n // keys quickly. Implicit (null) keys get added to this set with their index\\n var existingChildren = new Map();\\n\\n var existingChild = currentFirstChild;\\n while (existingChild !== null) {\\n if (existingChild.key !== null) {\\n existingChildren.set(existingChild.key, existingChild);\\n } else {\\n existingChildren.set(existingChild.index, existingChild);\\n }\\n existingChild = existingChild.sibling;\\n }\\n return existingChildren;\\n }\\n\\n function useFiber(fiber, pendingProps, expirationTime) {\\n // We currently set sibling to null and index to 0 here because it is easy\\n // to forget to do before returning it. E.g. for the single child case.\\n var clone = createWorkInProgress(fiber, pendingProps, expirationTime);\\n clone.index = 0;\\n clone.sibling = null;\\n return clone;\\n }\\n\\n function placeChild(newFiber, lastPlacedIndex, newIndex) {\\n newFiber.index = newIndex;\\n if (!shouldTrackSideEffects) {\\n // Noop.\\n return lastPlacedIndex;\\n }\\n var current$$1 = newFiber.alternate;\\n if (current$$1 !== null) {\\n var oldIndex = current$$1.index;\\n if (oldIndex < lastPlacedIndex) {\\n // This is a move.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n } else {\\n // This item can stay in place.\\n return oldIndex;\\n }\\n } else {\\n // This is an insertion.\\n newFiber.effectTag = Placement;\\n return lastPlacedIndex;\\n }\\n }\\n\\n function placeSingleChild(newFiber) {\\n // This is simpler for the single child case. We only need to do a\\n // placement for inserting new children.\\n if (shouldTrackSideEffects && newFiber.alternate === null) {\\n newFiber.effectTag = Placement;\\n }\\n return newFiber;\\n }\\n\\n function updateTextNode(returnFiber, current$$1, textContent, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostText) {\\n // Insert\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateElement(returnFiber, current$$1, element, expirationTime) {\\n if (current$$1 !== null && current$$1.elementType === element.type) {\\n // Move based on index\\n var existing = useFiber(current$$1, element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, current$$1, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n // Insert\\n var created = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n created.ref = coerceRef(returnFiber, current$$1, element);\\n created.return = returnFiber;\\n return created;\\n }\\n }\\n\\n function updatePortal(returnFiber, current$$1, portal, expirationTime) {\\n if (current$$1 === null || current$$1.tag !== HostPortal || current$$1.stateNode.containerInfo !== portal.containerInfo || current$$1.stateNode.implementation !== portal.implementation) {\\n // Insert\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function updateFragment(returnFiber, current$$1, fragment, expirationTime, key) {\\n if (current$$1 === null || current$$1.tag !== Fragment) {\\n // Insert\\n var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n // Update\\n var existing = useFiber(current$$1, fragment, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n }\\n\\n function createChild(returnFiber, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);\\n _created.ref = coerceRef(returnFiber, null, newChild);\\n _created.return = returnFiber;\\n return _created;\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);\\n _created2.return = returnFiber;\\n return _created2;\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);\\n _created3.return = returnFiber;\\n return _created3;\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {\\n // Update the fiber if the keys match, otherwise return null.\\n\\n var key = oldFiber !== null ? oldFiber.key : null;\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys. If the previous node is implicitly keyed\\n // we can continue to replace it without aborting even if it is not a text\\n // node.\\n if (key !== null) {\\n return null;\\n }\\n return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n if (newChild.key === key) {\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);\\n }\\n return updateElement(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n if (newChild.key === key) {\\n return updatePortal(returnFiber, oldFiber, newChild, expirationTime);\\n } else {\\n return null;\\n }\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n if (key !== null) {\\n return null;\\n }\\n\\n return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n // Text nodes don't have keys, so we neither have to check the old nor\\n // new node for the key. If both are text nodes, they match.\\n var matchedFiber = existingChildren.get(newIdx) || null;\\n return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);\\n }\\n\\n if (typeof newChild === 'object' && newChild !== null) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n {\\n var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n if (newChild.type === REACT_FRAGMENT_TYPE) {\\n return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);\\n }\\n return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);\\n }\\n case REACT_PORTAL_TYPE:\\n {\\n var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;\\n return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);\\n }\\n }\\n\\n if (isArray(newChild) || getIteratorFn(newChild)) {\\n var _matchedFiber3 = existingChildren.get(newIdx) || null;\\n return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);\\n }\\n\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n\\n return null;\\n }\\n\\n /**\\n * Warns if there is a duplicate or missing key\\n */\\n function warnOnInvalidKey(child, knownKeys) {\\n {\\n if (typeof child !== 'object' || child === null) {\\n return knownKeys;\\n }\\n switch (child.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n case REACT_PORTAL_TYPE:\\n warnForMissingKey(child);\\n var key = child.key;\\n if (typeof key !== 'string') {\\n break;\\n }\\n if (knownKeys === null) {\\n knownKeys = new Set();\\n knownKeys.add(key);\\n break;\\n }\\n if (!knownKeys.has(key)) {\\n knownKeys.add(key);\\n break;\\n }\\n warning$1(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.', key);\\n break;\\n default:\\n break;\\n }\\n }\\n return knownKeys;\\n }\\n\\n function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n // This algorithm can't optimize by searching from both ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n\\n {\\n // First, validate keys.\\n var knownKeys = null;\\n for (var i = 0; i < newChildren.length; i++) {\\n var child = newChildren[i];\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (oldFiber === null) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (newIdx === newChildren.length) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n if (!_newFiber) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber;\\n } else {\\n previousNewFiber.sibling = _newFiber;\\n }\\n previousNewFiber = _newFiber;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n if (_newFiber2) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber2.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber2;\\n } else {\\n previousNewFiber.sibling = _newFiber2;\\n }\\n previousNewFiber = _newFiber2;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {\\n // This is the same implementation as reconcileChildrenArray(),\\n // but using the iterator instead.\\n\\n var iteratorFn = getIteratorFn(newChildrenIterable);\\n !(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;\\n\\n {\\n // We don't support rendering Generators because it's a mutation.\\n // See https://github.com/facebook/react/issues/12995\\n if (typeof Symbol === 'function' &&\\n // $FlowFixMe Flow doesn't know about toStringTag\\n newChildrenIterable[Symbol.toStringTag] === 'Generator') {\\n !didWarnAboutGenerators ? warning$1(false, 'Using Generators as children is unsupported and will likely yield ' + 'unexpected results because enumerating a generator mutates it. ' + 'You may convert it to an array with `Array.from()` or the ' + '`[...spread]` operator before rendering. Keep in mind ' + 'you might need to polyfill these features for older browsers.') : void 0;\\n didWarnAboutGenerators = true;\\n }\\n\\n // Warn about using Maps as children\\n if (newChildrenIterable.entries === iteratorFn) {\\n !didWarnAboutMaps ? warning$1(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.') : void 0;\\n didWarnAboutMaps = true;\\n }\\n\\n // First, validate keys.\\n // We'll get a different iterator later for the main pass.\\n var _newChildren = iteratorFn.call(newChildrenIterable);\\n if (_newChildren) {\\n var knownKeys = null;\\n var _step = _newChildren.next();\\n for (; !_step.done; _step = _newChildren.next()) {\\n var child = _step.value;\\n knownKeys = warnOnInvalidKey(child, knownKeys);\\n }\\n }\\n }\\n\\n var newChildren = iteratorFn.call(newChildrenIterable);\\n !(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;\\n\\n var resultingFirstChild = null;\\n var previousNewFiber = null;\\n\\n var oldFiber = currentFirstChild;\\n var lastPlacedIndex = 0;\\n var newIdx = 0;\\n var nextOldFiber = null;\\n\\n var step = newChildren.next();\\n for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {\\n if (oldFiber.index > newIdx) {\\n nextOldFiber = oldFiber;\\n oldFiber = null;\\n } else {\\n nextOldFiber = oldFiber.sibling;\\n }\\n var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);\\n if (newFiber === null) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n if (!oldFiber) {\\n oldFiber = nextOldFiber;\\n }\\n break;\\n }\\n if (shouldTrackSideEffects) {\\n if (oldFiber && newFiber.alternate === null) {\\n // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber);\\n }\\n }\\n lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber;\\n } else {\\n // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber;\\n }\\n previousNewFiber = newFiber;\\n oldFiber = nextOldFiber;\\n }\\n\\n if (step.done) {\\n // We've reached the end of the new children. We can delete the rest.\\n deleteRemainingChildren(returnFiber, oldFiber);\\n return resultingFirstChild;\\n }\\n\\n if (oldFiber === null) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber3 = createChild(returnFiber, step.value, expirationTime);\\n if (_newFiber3 === null) {\\n continue;\\n }\\n lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber3;\\n } else {\\n previousNewFiber.sibling = _newFiber3;\\n }\\n previousNewFiber = _newFiber3;\\n }\\n return resultingFirstChild;\\n }\\n\\n // Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber);\\n\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (; !step.done; newIdx++, step = newChildren.next()) {\\n var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);\\n if (_newFiber4 !== null) {\\n if (shouldTrackSideEffects) {\\n if (_newFiber4.alternate !== null) {\\n // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);\\n }\\n }\\n lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);\\n if (previousNewFiber === null) {\\n resultingFirstChild = _newFiber4;\\n } else {\\n previousNewFiber.sibling = _newFiber4;\\n }\\n previousNewFiber = _newFiber4;\\n }\\n }\\n\\n if (shouldTrackSideEffects) {\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n existingChildren.forEach(function (child) {\\n return deleteChild(returnFiber, child);\\n });\\n }\\n\\n return resultingFirstChild;\\n }\\n\\n function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {\\n // There's no need to check for keys on text nodes since we don't have a\\n // way to define them.\\n if (currentFirstChild !== null && currentFirstChild.tag === HostText) {\\n // We already have an existing node so let's just update it and delete\\n // the rest.\\n deleteRemainingChildren(returnFiber, currentFirstChild.sibling);\\n var existing = useFiber(currentFirstChild, textContent, expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n }\\n // The existing first child is not a text node so we need to create one\\n // and delete the existing ones.\\n deleteRemainingChildren(returnFiber, currentFirstChild);\\n var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {\\n var key = element.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.elementType === element.type) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);\\n existing.ref = coerceRef(returnFiber, child, element);\\n existing.return = returnFiber;\\n {\\n existing._debugSource = element._source;\\n existing._debugOwner = element._owner;\\n }\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n if (element.type === REACT_FRAGMENT_TYPE) {\\n var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);\\n created.return = returnFiber;\\n return created;\\n } else {\\n var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);\\n _created4.ref = coerceRef(returnFiber, currentFirstChild, element);\\n _created4.return = returnFiber;\\n return _created4;\\n }\\n }\\n\\n function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {\\n var key = portal.key;\\n var child = currentFirstChild;\\n while (child !== null) {\\n // TODO: If key === null and child.key === null, then this only applies to\\n // the first item in the list.\\n if (child.key === key) {\\n if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {\\n deleteRemainingChildren(returnFiber, child.sibling);\\n var existing = useFiber(child, portal.children || [], expirationTime);\\n existing.return = returnFiber;\\n return existing;\\n } else {\\n deleteRemainingChildren(returnFiber, child);\\n break;\\n }\\n } else {\\n deleteChild(returnFiber, child);\\n }\\n child = child.sibling;\\n }\\n\\n var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);\\n created.return = returnFiber;\\n return created;\\n }\\n\\n // This API will tag the children with the side-effect of the reconciliation\\n // itself. They will be added to the side-effect list as we pass through the\\n // children and the parent.\\n function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;\\n if (isUnkeyedTopLevelFragment) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\\n\\n return reconcileChildFibers;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.69689286","0.6940482","0.6940482","0.6940482","0.6940482","0.6933627","0.6933627","0.6933627","0.6933627","0.6933627","0.6933627","0.6927816","0.6927816","0.6927816","0.6927629","0.6927629","0.6927629","0.6923651","0.6921517","0.69135743","0.6900002","0.6887152","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68390375","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.68356806","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463","0.6818463"],"string":"[\n \"0.69689286\",\n \"0.6940482\",\n \"0.6940482\",\n \"0.6940482\",\n \"0.6940482\",\n \"0.6933627\",\n \"0.6933627\",\n \"0.6933627\",\n \"0.6933627\",\n \"0.6933627\",\n \"0.6933627\",\n \"0.6927816\",\n \"0.6927816\",\n \"0.6927816\",\n \"0.6927629\",\n \"0.6927629\",\n \"0.6927629\",\n \"0.6923651\",\n \"0.6921517\",\n \"0.69135743\",\n \"0.6900002\",\n \"0.6887152\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68390375\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.68356806\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\",\n \"0.6818463\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5784,"cells":{"query":{"kind":"string","value":"TODO: Remove this and use reconcileChildrenAtExpirationTime directly."},"document":{"kind":"string","value":"function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}","function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}","function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}","function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}","function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}","function reconcileChildren(current, workInProgress, nextChildren) {\n\t reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n\t }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildren(current, workInProgress, nextChildren) {\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChildren, expirationTime) {\n if ((typeof newChildren === \"undefined\" ? \"undefined\" : _typeof(newChildren)) === \"object\" && newChildren !== null) {\n switch (newChildren.$$typeof) {\n case _Symbols.ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChildren, expirationTime));\n }\n }\n if (Array.isArray(newChildren)) {\n // children为数组\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime);\n }\n\n // newChildren: null/undefined\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n}","function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\n for (// This algorithm can't optimize by searching from boths ends since we\n // don't have backpointers on fibers. I'm trying to see how far we can get\n // with that model. If it ends up not being worth the tradeoffs, we can\n // add it later.\n // Even with a two ended optimization, we'd want to optimize for the case\n // where there are few changes and brute force the comparison instead of\n // going for the Map. It'd like to explore hitting that path first in\n // forward-only mode and only go for the Map once we notice that we need\n // lots of look ahead. This doesn't handle reversal as well as two ended\n // search but that's unusual. Besides, for the two ended optimization to\n // work on Iterables, we'd need to copy the whole set.\n // In this first iteration, we'll just live with hitting the bad case\n // (adding everything to a Map) in for every insert/move.\n // If you change this code, also update reconcileChildrenIterator() which\n // uses the same algorithm.\n var resultingFirstChild = null, previousNewFiber = null, oldFiber = currentFirstChild, lastPlacedIndex = 0, newIdx = 0, nextOldFiber = null; null !== oldFiber && newIdx < newChildren.length; newIdx++) {\n oldFiber.index > newIdx ? (nextOldFiber = oldFiber, oldFiber = null) : nextOldFiber = oldFiber.sibling;\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\n if (null === newFiber) {\n // TODO: This breaks on empty slots like null children. That's\n // unfortunate because it triggers the slow path all the time. We need\n // a better way to communicate whether this was a miss or null,\n // boolean, undefined, etc.\n null === oldFiber && (oldFiber = nextOldFiber);\n break;\n }\n shouldTrackSideEffects && oldFiber && null === newFiber.alternate && // We matched the slot, but we didn't reuse the existing fiber, so we\n // need to delete the existing child.\n deleteChild(returnFiber, oldFiber), lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx), \n null === previousNewFiber ? // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = newFiber : // TODO: Defer siblings if we're not at the right index for this slot.\n // I.e. if we had null values before, then we want to defer this\n // for each null value. However, we also don't want to call updateSlot\n // with the previous one.\n previousNewFiber.sibling = newFiber, previousNewFiber = newFiber, oldFiber = nextOldFiber;\n }\n if (newIdx === newChildren.length) // We've reached the end of the new children. We can delete the rest.\n return deleteRemainingChildren(returnFiber, oldFiber), resultingFirstChild;\n if (null === oldFiber) {\n // If we don't have any more existing children we can choose a fast path\n // since the rest will all be insertions.\n for (;newIdx < newChildren.length; newIdx++) {\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\n _newFiber && (lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx), \n null === previousNewFiber ? // TODO: Move out of the loop. This only happens for the first run.\n resultingFirstChild = _newFiber : previousNewFiber.sibling = _newFiber, previousNewFiber = _newFiber);\n }\n return resultingFirstChild;\n }\n // Keep scanning and use the map to restore deleted items as moves.\n for (// Add all children to a key map for quick lookups.\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); newIdx < newChildren.length; newIdx++) {\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\n _newFiber2 && (shouldTrackSideEffects && null !== _newFiber2.alternate && // The new fiber is a work in progress, but if there exists a\n // current, that means that we reused the fiber. We need to delete\n // it from the child list so that we don't add it to the deletion\n // list.\n existingChildren.delete(null === _newFiber2.key ? newIdx : _newFiber2.key), lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx), \n null === previousNewFiber ? resultingFirstChild = _newFiber2 : previousNewFiber.sibling = _newFiber2, \n previousNewFiber = _newFiber2);\n }\n // Any existing children that weren't consumed above were deleted. We need\n // to add them to the deletion list.\n return shouldTrackSideEffects && existingChildren.forEach(function(child) {\n return deleteChild(returnFiber, child);\n }), resultingFirstChild;\n }","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n\t// If the top level item is an array, we treat it as a set of children,\n\t// not as a fragment. Nested arrays on the other hand will be treated as\n\t// fragment nodes. Recursion happens at the normal flow.\n\t// Handle top level unkeyed fragments as if they were arrays.\n\t// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n\t// We treat the ambiguous cases above the same.\n\tif((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null){newChild=newChild.props.children;}// Handle object types\n\tvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_CALL_TYPE:return placeSingleChild(reconcileSingleCall(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_RETURN_TYPE:return placeSingleChild(reconcileSingleReturn(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'){// If the new child is undefined, and the return fiber is a composite\n\t// component, throw an error. If Fiber return types are disabled,\n\t// we already threw above.\n\tswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\n\tbreak;}}}// Intentionally fall through to the next case, which handles both\n\t// functions and classes\n\t// eslint-disable-next-lined no-fallthrough\n\tcase FunctionalComponent:{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');}}}// Remaining cases are all treated as empty.\n\treturn deleteRemainingChildren(returnFiber,currentFirstChild);}","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level unkeyed fragments as if they were arrays.\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n// We treat the ambiguous cases above the same.\nif((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null){newChild=newChild.props.children;}// Handle object types\nvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_CALL_TYPE:return placeSingleChild(reconcileSingleCall(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_RETURN_TYPE:return placeSingleChild(reconcileSingleReturn(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'){// If the new child is undefined, and the return fiber is a composite\n// component, throw an error. If Fiber return types are disabled,\n// we already threw above.\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\nbreak;}}}// Intentionally fall through to the next case, which handles both\n// functions and classes\n// eslint-disable-next-lined no-fallthrough\ncase FunctionalComponent:{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');}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level unkeyed fragments as if they were arrays.\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n// We treat the ambiguous cases above the same.\nif((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null){newChild=newChild.props.children;}// Handle object types\nvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_CALL_TYPE:return placeSingleChild(reconcileSingleCall(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_RETURN_TYPE:return placeSingleChild(reconcileSingleReturn(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'){// If the new child is undefined, and the return fiber is a composite\n// component, throw an error. If Fiber return types are disabled,\n// we already threw above.\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\nbreak;}}}// Intentionally fall through to the next case, which handles both\n// functions and classes\n// eslint-disable-next-lined no-fallthrough\ncase FunctionalComponent:{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');}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n\t // This function is not recursive.\n\t // If the top level item is an array, we treat it as a set of children,\n\t // not as a fragment. Nested arrays on the other hand will be treated as\n\t // fragment nodes. Recursion happens at the normal flow.\n\t\n\t // Handle top level unkeyed fragments as if they were arrays.\n\t // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n\t // We treat the ambiguous cases above the same.\n\t if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n\t newChild = newChild.props.children;\n\t }\n\t\n\t // Handle object types\n\t var isObject = typeof newChild === 'object' && newChild !== null;\n\t\n\t if (isObject) {\n\t switch (newChild.$$typeof) {\n\t case REACT_ELEMENT_TYPE:\n\t return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\t\n\t case REACT_CALL_TYPE:\n\t return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n\t case REACT_RETURN_TYPE:\n\t return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n\t case REACT_PORTAL_TYPE:\n\t return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n\t }\n\t }\n\t\n\t if (typeof newChild === 'string' || typeof newChild === 'number') {\n\t return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n\t }\n\t\n\t if (isArray$1(newChild)) {\n\t return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n\t }\n\t\n\t if (getIteratorFn(newChild)) {\n\t return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n\t }\n\t\n\t if (isObject) {\n\t throwOnInvalidObjectType(returnFiber, newChild);\n\t }\n\t\n\t {\n\t if (typeof newChild === 'function') {\n\t warnOnFunctionType();\n\t }\n\t }\n\t if (typeof newChild === 'undefined') {\n\t // If the new child is undefined, and the return fiber is a composite\n\t // component, throw an error. If Fiber return types are disabled,\n\t // we already threw above.\n\t switch (returnFiber.tag) {\n\t case ClassComponent:\n\t {\n\t {\n\t var instance = returnFiber.stateNode;\n\t if (instance.render._isMockFunction) {\n\t // We allow auto-mocks to proceed as if they're returning null.\n\t break;\n\t }\n\t }\n\t }\n\t // Intentionally fall through to the next case, which handles both\n\t // functions and classes\n\t // eslint-disable-next-lined no-fallthrough\n\t case FunctionalComponent:\n\t {\n\t var Component = returnFiber.type;\n\t 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');\n\t }\n\t }\n\t }\n\t\n\t // Remaining cases are all treated as empty.\n\t return deleteRemainingChildren(returnFiber, currentFirstChild);\n\t }","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level unkeyed fragments as if they were arrays.\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n// We treat the ambiguous cases above the same.\nvar isUnkeyedTopLevelFragment=_typeof(newChild)==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\nvar isObject=_typeof(newChild)==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\n// component, throw an error. If Fiber return types are disabled,\n// we already threw above.\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\nbreak;}}}// Intentionally fall through to the next case, which handles both\n// functions and classes\n// eslint-disable-next-lined no-fallthrough\ncase FunctionComponent:{var Component=returnFiber.type;{{throw Error((Component.displayName||Component.name||'Component')+\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\");}}}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level unkeyed fragments as if they were arrays.\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n// We treat the ambiguous cases above the same.\nvar isUnkeyedTopLevelFragment=_typeof(newChild)==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\nvar isObject=_typeof(newChild)==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\n// component, throw an error. If Fiber return types are disabled,\n// we already threw above.\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\nbreak;}}}// Intentionally fall through to the next case, which handles both\n// functions and classes\n// eslint-disable-next-lined no-fallthrough\ncase FunctionComponent:{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');}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level unkeyed fragments as if they were arrays.\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n// We treat the ambiguous cases above the same.\nvar isUnkeyedTopLevelFragment=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\nvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\n// component, throw an error. If Fiber return types are disabled,\n// we already threw above.\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\nbreak;}}}// Intentionally fall through to the next case, which handles both\n// functions and classes\n// eslint-disable-next-lined no-fallthrough\ncase FunctionalComponent:{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');}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\n // This function is not recursive.\n // If the top level item is an array, we treat it as a set of children,\n // not as a fragment. Nested arrays on the other hand will be treated as\n // fragment nodes. Recursion happens at the normal flow.\n\n // Handle top level unkeyed fragments as if they were arrays.\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\n // We treat the ambiguous cases above the same.\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\n newChild = newChild.props.children;\n }\n\n // Handle object types\n var isObject = typeof newChild === 'object' && newChild !== null;\n\n if (isObject) {\n switch (newChild.$$typeof) {\n case REACT_ELEMENT_TYPE:\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\n\n case REACT_CALL_TYPE:\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_RETURN_TYPE:\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\n case REACT_PORTAL_TYPE:\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\n }\n }\n\n if (typeof newChild === 'string' || typeof newChild === 'number') {\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\n }\n\n if (isArray$1(newChild)) {\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (getIteratorFn(newChild)) {\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\n }\n\n if (isObject) {\n throwOnInvalidObjectType(returnFiber, newChild);\n }\n\n {\n if (typeof newChild === 'function') {\n warnOnFunctionType();\n }\n }\n if (typeof newChild === 'undefined') {\n // If the new child is undefined, and the return fiber is a composite\n // component, throw an error. If Fiber return types are disabled,\n // we already threw above.\n switch (returnFiber.tag) {\n case ClassComponent:\n {\n {\n var instance = returnFiber.stateNode;\n if (instance.render._isMockFunction) {\n // We allow auto-mocks to proceed as if they're returning null.\n break;\n }\n }\n }\n // Intentionally fall through to the next case, which handles both\n // functions and classes\n // eslint-disable-next-lined no-fallthrough\n case FunctionalComponent:\n {\n var Component = returnFiber.type;\n 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');\n }\n }\n }\n\n // Remaining cases are all treated as empty.\n return deleteRemainingChildren(returnFiber, currentFirstChild);\n }","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level unkeyed fragments as if they were arrays.\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n// We treat the ambiguous cases above the same.\nvar isUnkeyedTopLevelFragment=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\nvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\n// component, throw an error. If Fiber return types are disabled,\n// we already threw above.\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\nbreak;}}}// Intentionally fall through to the next case, which handles both\n// functions and classes\n// eslint-disable-next-lined no-fallthrough\ncase FunctionComponent:{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');}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level unkeyed fragments as if they were arrays.\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n// We treat the ambiguous cases above the same.\nvar isUnkeyedTopLevelFragment=typeof newChild==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\nvar isObject=typeof newChild==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\n// component, throw an error. If Fiber return types are disabled,\n// we already threw above.\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\nbreak;}}}// Intentionally fall through to the next case, which handles both\n// functions and classes\n// eslint-disable-next-lined no-fallthrough\ncase FunctionComponent:{var Component=returnFiber.type;{{throw Error((Component.displayName||Component.name||'Component')+\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\");}}}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}","function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\n// If the top level item is an array, we treat it as a set of children,\n// not as a fragment. Nested arrays on the other hand will be treated as\n// fragment nodes. Recursion happens at the normal flow.\n// Handle top level unkeyed fragments as if they were arrays.\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\n// We treat the ambiguous cases above the same.\nvar isUnkeyedTopLevelFragment=typeof newChild==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\nvar isObject=typeof newChild==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\n// component, throw an error. If Fiber return types are disabled,\n// we already threw above.\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\nbreak;}}}// Intentionally fall through to the next case, which handles both\n// functions and classes\n// eslint-disable-next-lined no-fallthrough\ncase FunctionComponent:{var Component=returnFiber.type;{{throw Error((Component.displayName||Component.name||'Component')+\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\");}}}}}// Remaining cases are all treated as empty.\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}"],"string":"[\n \"function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}\",\n \"function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}\",\n \"function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}\",\n \"function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}\",\n \"function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n\\t reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n\\t }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildren(current, workInProgress, nextChildren) {\\n reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n if ((typeof newChildren === \\\"undefined\\\" ? \\\"undefined\\\" : _typeof(newChildren)) === \\\"object\\\" && newChildren !== null) {\\n switch (newChildren.$$typeof) {\\n case _Symbols.ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChildren, expirationTime));\\n }\\n }\\n if (Array.isArray(newChildren)) {\\n // children为数组\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime);\\n }\\n\\n // newChildren: null/undefined\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n}\",\n \"function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {\\n for (// This algorithm can't optimize by searching from boths ends since we\\n // don't have backpointers on fibers. I'm trying to see how far we can get\\n // with that model. If it ends up not being worth the tradeoffs, we can\\n // add it later.\\n // Even with a two ended optimization, we'd want to optimize for the case\\n // where there are few changes and brute force the comparison instead of\\n // going for the Map. It'd like to explore hitting that path first in\\n // forward-only mode and only go for the Map once we notice that we need\\n // lots of look ahead. This doesn't handle reversal as well as two ended\\n // search but that's unusual. Besides, for the two ended optimization to\\n // work on Iterables, we'd need to copy the whole set.\\n // In this first iteration, we'll just live with hitting the bad case\\n // (adding everything to a Map) in for every insert/move.\\n // If you change this code, also update reconcileChildrenIterator() which\\n // uses the same algorithm.\\n var resultingFirstChild = null, previousNewFiber = null, oldFiber = currentFirstChild, lastPlacedIndex = 0, newIdx = 0, nextOldFiber = null; null !== oldFiber && newIdx < newChildren.length; newIdx++) {\\n oldFiber.index > newIdx ? (nextOldFiber = oldFiber, oldFiber = null) : nextOldFiber = oldFiber.sibling;\\n var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);\\n if (null === newFiber) {\\n // TODO: This breaks on empty slots like null children. That's\\n // unfortunate because it triggers the slow path all the time. We need\\n // a better way to communicate whether this was a miss or null,\\n // boolean, undefined, etc.\\n null === oldFiber && (oldFiber = nextOldFiber);\\n break;\\n }\\n shouldTrackSideEffects && oldFiber && null === newFiber.alternate && // We matched the slot, but we didn't reuse the existing fiber, so we\\n // need to delete the existing child.\\n deleteChild(returnFiber, oldFiber), lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx), \\n null === previousNewFiber ? // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = newFiber : // TODO: Defer siblings if we're not at the right index for this slot.\\n // I.e. if we had null values before, then we want to defer this\\n // for each null value. However, we also don't want to call updateSlot\\n // with the previous one.\\n previousNewFiber.sibling = newFiber, previousNewFiber = newFiber, oldFiber = nextOldFiber;\\n }\\n if (newIdx === newChildren.length) // We've reached the end of the new children. We can delete the rest.\\n return deleteRemainingChildren(returnFiber, oldFiber), resultingFirstChild;\\n if (null === oldFiber) {\\n // If we don't have any more existing children we can choose a fast path\\n // since the rest will all be insertions.\\n for (;newIdx < newChildren.length; newIdx++) {\\n var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);\\n _newFiber && (lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx), \\n null === previousNewFiber ? // TODO: Move out of the loop. This only happens for the first run.\\n resultingFirstChild = _newFiber : previousNewFiber.sibling = _newFiber, previousNewFiber = _newFiber);\\n }\\n return resultingFirstChild;\\n }\\n // Keep scanning and use the map to restore deleted items as moves.\\n for (// Add all children to a key map for quick lookups.\\n var existingChildren = mapRemainingChildren(returnFiber, oldFiber); newIdx < newChildren.length; newIdx++) {\\n var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);\\n _newFiber2 && (shouldTrackSideEffects && null !== _newFiber2.alternate && // The new fiber is a work in progress, but if there exists a\\n // current, that means that we reused the fiber. We need to delete\\n // it from the child list so that we don't add it to the deletion\\n // list.\\n existingChildren.delete(null === _newFiber2.key ? newIdx : _newFiber2.key), lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx), \\n null === previousNewFiber ? resultingFirstChild = _newFiber2 : previousNewFiber.sibling = _newFiber2, \\n previousNewFiber = _newFiber2);\\n }\\n // Any existing children that weren't consumed above were deleted. We need\\n // to add them to the deletion list.\\n return shouldTrackSideEffects && existingChildren.forEach(function(child) {\\n return deleteChild(returnFiber, child);\\n }), resultingFirstChild;\\n }\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n\\t// If the top level item is an array, we treat it as a set of children,\\n\\t// not as a fragment. Nested arrays on the other hand will be treated as\\n\\t// fragment nodes. Recursion happens at the normal flow.\\n\\t// Handle top level unkeyed fragments as if they were arrays.\\n\\t// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n\\t// We treat the ambiguous cases above the same.\\n\\tif((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null){newChild=newChild.props.children;}// Handle object types\\n\\tvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_CALL_TYPE:return placeSingleChild(reconcileSingleCall(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_RETURN_TYPE:return placeSingleChild(reconcileSingleReturn(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'){// If the new child is undefined, and the return fiber is a composite\\n\\t// component, throw an error. If Fiber return types are disabled,\\n\\t// we already threw above.\\n\\tswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\n\\tbreak;}}}// Intentionally fall through to the next case, which handles both\\n\\t// functions and classes\\n\\t// eslint-disable-next-lined no-fallthrough\\n\\tcase FunctionalComponent:{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');}}}// Remaining cases are all treated as empty.\\n\\treturn deleteRemainingChildren(returnFiber,currentFirstChild);}\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level unkeyed fragments as if they were arrays.\\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n// We treat the ambiguous cases above the same.\\nif((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null){newChild=newChild.props.children;}// Handle object types\\nvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_CALL_TYPE:return placeSingleChild(reconcileSingleCall(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_RETURN_TYPE:return placeSingleChild(reconcileSingleReturn(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'){// If the new child is undefined, and the return fiber is a composite\\n// component, throw an error. If Fiber return types are disabled,\\n// we already threw above.\\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\nbreak;}}}// Intentionally fall through to the next case, which handles both\\n// functions and classes\\n// eslint-disable-next-lined no-fallthrough\\ncase FunctionalComponent:{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');}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level unkeyed fragments as if they were arrays.\\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n// We treat the ambiguous cases above the same.\\nif((typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null){newChild=newChild.props.children;}// Handle object types\\nvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_CALL_TYPE:return placeSingleChild(reconcileSingleCall(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_RETURN_TYPE:return placeSingleChild(reconcileSingleReturn(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'){// If the new child is undefined, and the return fiber is a composite\\n// component, throw an error. If Fiber return types are disabled,\\n// we already threw above.\\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\nbreak;}}}// Intentionally fall through to the next case, which handles both\\n// functions and classes\\n// eslint-disable-next-lined no-fallthrough\\ncase FunctionalComponent:{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');}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n\\t // This function is not recursive.\\n\\t // If the top level item is an array, we treat it as a set of children,\\n\\t // not as a fragment. Nested arrays on the other hand will be treated as\\n\\t // fragment nodes. Recursion happens at the normal flow.\\n\\t\\n\\t // Handle top level unkeyed fragments as if they were arrays.\\n\\t // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n\\t // We treat the ambiguous cases above the same.\\n\\t if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n\\t newChild = newChild.props.children;\\n\\t }\\n\\t\\n\\t // Handle object types\\n\\t var isObject = typeof newChild === 'object' && newChild !== null;\\n\\t\\n\\t if (isObject) {\\n\\t switch (newChild.$$typeof) {\\n\\t case REACT_ELEMENT_TYPE:\\n\\t return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\t\\n\\t case REACT_CALL_TYPE:\\n\\t return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\t case REACT_RETURN_TYPE:\\n\\t return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\t case REACT_PORTAL_TYPE:\\n\\t return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\t }\\n\\t }\\n\\t\\n\\t if (typeof newChild === 'string' || typeof newChild === 'number') {\\n\\t return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n\\t }\\n\\t\\n\\t if (isArray$1(newChild)) {\\n\\t return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n\\t }\\n\\t\\n\\t if (getIteratorFn(newChild)) {\\n\\t return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n\\t }\\n\\t\\n\\t if (isObject) {\\n\\t throwOnInvalidObjectType(returnFiber, newChild);\\n\\t }\\n\\t\\n\\t {\\n\\t if (typeof newChild === 'function') {\\n\\t warnOnFunctionType();\\n\\t }\\n\\t }\\n\\t if (typeof newChild === 'undefined') {\\n\\t // If the new child is undefined, and the return fiber is a composite\\n\\t // component, throw an error. If Fiber return types are disabled,\\n\\t // we already threw above.\\n\\t switch (returnFiber.tag) {\\n\\t case ClassComponent:\\n\\t {\\n\\t {\\n\\t var instance = returnFiber.stateNode;\\n\\t if (instance.render._isMockFunction) {\\n\\t // We allow auto-mocks to proceed as if they're returning null.\\n\\t break;\\n\\t }\\n\\t }\\n\\t }\\n\\t // Intentionally fall through to the next case, which handles both\\n\\t // functions and classes\\n\\t // eslint-disable-next-lined no-fallthrough\\n\\t case FunctionalComponent:\\n\\t {\\n\\t var Component = returnFiber.type;\\n\\t 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');\\n\\t }\\n\\t }\\n\\t }\\n\\t\\n\\t // Remaining cases are all treated as empty.\\n\\t return deleteRemainingChildren(returnFiber, currentFirstChild);\\n\\t }\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level unkeyed fragments as if they were arrays.\\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n// We treat the ambiguous cases above the same.\\nvar isUnkeyedTopLevelFragment=_typeof(newChild)==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\\nvar isObject=_typeof(newChild)==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\\n// component, throw an error. If Fiber return types are disabled,\\n// we already threw above.\\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\nbreak;}}}// Intentionally fall through to the next case, which handles both\\n// functions and classes\\n// eslint-disable-next-lined no-fallthrough\\ncase FunctionComponent:{var Component=returnFiber.type;{{throw Error((Component.displayName||Component.name||'Component')+\\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");}}}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level unkeyed fragments as if they were arrays.\\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n// We treat the ambiguous cases above the same.\\nvar isUnkeyedTopLevelFragment=_typeof(newChild)==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\\nvar isObject=_typeof(newChild)==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\\n// component, throw an error. If Fiber return types are disabled,\\n// we already threw above.\\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\nbreak;}}}// Intentionally fall through to the next case, which handles both\\n// functions and classes\\n// eslint-disable-next-lined no-fallthrough\\ncase FunctionComponent:{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');}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level unkeyed fragments as if they were arrays.\\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n// We treat the ambiguous cases above the same.\\nvar isUnkeyedTopLevelFragment=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\\nvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\\n// component, throw an error. If Fiber return types are disabled,\\n// we already threw above.\\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\nbreak;}}}// Intentionally fall through to the next case, which handles both\\n// functions and classes\\n// eslint-disable-next-lined no-fallthrough\\ncase FunctionalComponent:{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');}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {\\n // This function is not recursive.\\n // If the top level item is an array, we treat it as a set of children,\\n // not as a fragment. Nested arrays on the other hand will be treated as\\n // fragment nodes. Recursion happens at the normal flow.\\n\\n // Handle top level unkeyed fragments as if they were arrays.\\n // This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n // We treat the ambiguous cases above the same.\\n if (typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null) {\\n newChild = newChild.props.children;\\n }\\n\\n // Handle object types\\n var isObject = typeof newChild === 'object' && newChild !== null;\\n\\n if (isObject) {\\n switch (newChild.$$typeof) {\\n case REACT_ELEMENT_TYPE:\\n return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));\\n\\n case REACT_CALL_TYPE:\\n return placeSingleChild(reconcileSingleCall(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_RETURN_TYPE:\\n return placeSingleChild(reconcileSingleReturn(returnFiber, currentFirstChild, newChild, expirationTime));\\n case REACT_PORTAL_TYPE:\\n return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));\\n }\\n }\\n\\n if (typeof newChild === 'string' || typeof newChild === 'number') {\\n return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));\\n }\\n\\n if (isArray$1(newChild)) {\\n return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (getIteratorFn(newChild)) {\\n return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);\\n }\\n\\n if (isObject) {\\n throwOnInvalidObjectType(returnFiber, newChild);\\n }\\n\\n {\\n if (typeof newChild === 'function') {\\n warnOnFunctionType();\\n }\\n }\\n if (typeof newChild === 'undefined') {\\n // If the new child is undefined, and the return fiber is a composite\\n // component, throw an error. If Fiber return types are disabled,\\n // we already threw above.\\n switch (returnFiber.tag) {\\n case ClassComponent:\\n {\\n {\\n var instance = returnFiber.stateNode;\\n if (instance.render._isMockFunction) {\\n // We allow auto-mocks to proceed as if they're returning null.\\n break;\\n }\\n }\\n }\\n // Intentionally fall through to the next case, which handles both\\n // functions and classes\\n // eslint-disable-next-lined no-fallthrough\\n case FunctionalComponent:\\n {\\n var Component = returnFiber.type;\\n 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');\\n }\\n }\\n }\\n\\n // Remaining cases are all treated as empty.\\n return deleteRemainingChildren(returnFiber, currentFirstChild);\\n }\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level unkeyed fragments as if they were arrays.\\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n// We treat the ambiguous cases above the same.\\nvar isUnkeyedTopLevelFragment=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\\nvar isObject=(typeof newChild==='undefined'?'undefined':_typeof(newChild))==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\\n// component, throw an error. If Fiber return types are disabled,\\n// we already threw above.\\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\nbreak;}}}// Intentionally fall through to the next case, which handles both\\n// functions and classes\\n// eslint-disable-next-lined no-fallthrough\\ncase FunctionComponent:{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');}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level unkeyed fragments as if they were arrays.\\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n// We treat the ambiguous cases above the same.\\nvar isUnkeyedTopLevelFragment=typeof newChild==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\\nvar isObject=typeof newChild==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\\n// component, throw an error. If Fiber return types are disabled,\\n// we already threw above.\\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\nbreak;}}}// Intentionally fall through to the next case, which handles both\\n// functions and classes\\n// eslint-disable-next-lined no-fallthrough\\ncase FunctionComponent:{var Component=returnFiber.type;{{throw Error((Component.displayName||Component.name||'Component')+\\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");}}}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}\",\n \"function reconcileChildFibers(returnFiber,currentFirstChild,newChild,expirationTime){// This function is not recursive.\\n// If the top level item is an array, we treat it as a set of children,\\n// not as a fragment. Nested arrays on the other hand will be treated as\\n// fragment nodes. Recursion happens at the normal flow.\\n// Handle top level unkeyed fragments as if they were arrays.\\n// This leads to an ambiguity between <>{[...]}</> and <>...</>.\\n// We treat the ambiguous cases above the same.\\nvar isUnkeyedTopLevelFragment=typeof newChild==='object'&&newChild!==null&&newChild.type===REACT_FRAGMENT_TYPE&&newChild.key===null;if(isUnkeyedTopLevelFragment){newChild=newChild.props.children;}// Handle object types\\nvar isObject=typeof newChild==='object'&&newChild!==null;if(isObject){switch(newChild.$$typeof){case REACT_ELEMENT_TYPE:return placeSingleChild(reconcileSingleElement(returnFiber,currentFirstChild,newChild,expirationTime));case REACT_PORTAL_TYPE:return placeSingleChild(reconcileSinglePortal(returnFiber,currentFirstChild,newChild,expirationTime));}}if(typeof newChild==='string'||typeof newChild==='number'){return placeSingleChild(reconcileSingleTextNode(returnFiber,currentFirstChild,''+newChild,expirationTime));}if(isArray$1(newChild)){return reconcileChildrenArray(returnFiber,currentFirstChild,newChild,expirationTime);}if(getIteratorFn(newChild)){return reconcileChildrenIterator(returnFiber,currentFirstChild,newChild,expirationTime);}if(isObject){throwOnInvalidObjectType(returnFiber,newChild);}{if(typeof newChild==='function'){warnOnFunctionType();}}if(typeof newChild==='undefined'&&!isUnkeyedTopLevelFragment){// If the new child is undefined, and the return fiber is a composite\\n// component, throw an error. If Fiber return types are disabled,\\n// we already threw above.\\nswitch(returnFiber.tag){case ClassComponent:{{var instance=returnFiber.stateNode;if(instance.render._isMockFunction){// We allow auto-mocks to proceed as if they're returning null.\\nbreak;}}}// Intentionally fall through to the next case, which handles both\\n// functions and classes\\n// eslint-disable-next-lined no-fallthrough\\ncase FunctionComponent:{var Component=returnFiber.type;{{throw Error((Component.displayName||Component.name||'Component')+\\\"(...): Nothing was returned from render. This usually means a return statement is missing. Or, to render nothing, return null.\\\");}}}}}// Remaining cases are all treated as empty.\\nreturn deleteRemainingChildren(returnFiber,currentFirstChild);}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.823957","0.823957","0.823957","0.823957","0.823957","0.78228706","0.77402437","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7718201","0.7712429","0.7712429","0.75441444","0.7471969","0.6284775","0.5956249","0.5902389","0.58237374","0.58237374","0.581561","0.5743534","0.5736157","0.573463","0.573463","0.57320064","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.5710973","0.57095784","0.5700274","0.5700274"],"string":"[\n \"0.823957\",\n \"0.823957\",\n \"0.823957\",\n \"0.823957\",\n \"0.823957\",\n \"0.78228706\",\n \"0.77402437\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7718201\",\n \"0.7712429\",\n \"0.7712429\",\n \"0.75441444\",\n \"0.7471969\",\n \"0.6284775\",\n \"0.5956249\",\n \"0.5902389\",\n \"0.58237374\",\n \"0.58237374\",\n \"0.581561\",\n \"0.5743534\",\n \"0.5736157\",\n \"0.573463\",\n \"0.573463\",\n \"0.57320064\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.5710973\",\n \"0.57095784\",\n \"0.5700274\",\n \"0.5700274\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7481744"},"document_rank":{"kind":"string","value":"60"}}},{"rowIdx":5785,"cells":{"query":{"kind":"string","value":"TODO: Delete memoizeProps/State and move to reconcile/bailout instead"},"document":{"kind":"string","value":"function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function memoizeProps(workInProgress, nextProps) {\n\t workInProgress.memoizedProps = nextProps;\n\t }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }","static getDerivedStateFromProps(props, state){\n if (state.originalResults !== props.results){\n console.warn('props.results have changed, resetting some state -- ');\n return {\n 'results' : props.results.slice(0),\n 'openDetailPanes' : {},\n 'originalResults' : props.results\n };\n }\n return null;\n }","static getDerivedStateFromProps(props, state) {\n if (props.errors !== state.errors) {\n return {\n errors: props.errors\n };\n } else {\n return null;\n }\n }","async function tester () {\n try {\n var state = await reactDOM.current.stateNode.current.child.memoizedState;\n } catch(e) {\n console.log('error: ' + e);\n }\n for (let key in state) {\n if (state[key].constructor === Array) {\n let arr = state[key];\n for (let i = 0; i < arr.length; i++) {\n // console.log(arr[i]);\n }\n }\n }\n}","static getDerivedStateFromProps(props, state) {\n const newState = {};\n\n // These variables are derived from the props\n let loading = props.loading;\n let networkStatus = props.networkStatus;\n\n // These variables are persisted across re-renders and updated based on\n // props in this function\n let refetching = state.refetching;\n\n const cacheWasCleared =\n // It's only possible to clear the cache after data has successfully\n // loaded at least once\n state.dataSeen &&\n // data === null is a valid value and doesn't indicate cache\n // clearing\n props.data !== null &&\n // When cache is cleared, we get back either an empty object or undefined\n // depending on if it's an item that was cleared or a field on an item.\n // TODO: Pull the query names out of the `query` prop because a\n // query might have multiple, but only one was invalidated in the\n // cache\n (!props.data || !Object.keys(props.data).length);\n\n // There's some legitimate data, so we're not refetching anymore\n if (refetching && !loading && !cacheWasCleared) {\n refetching = false;\n newState.refetching = refetching;\n }\n\n // When the cache is cleared, a re-render is triggered, but it\n // incorrectly re-renders the component as 'loading: true'.\n // The canonical Apollo <Query> component re-renders the component as\n // { loading: false, networkStatus: 4 }, so we emulate that here.\n if (refetching) {\n loading = true;\n networkStatus = 4;\n }\n\n if (!loading) {\n if (cacheWasCleared) {\n // We've received some data, but it's the result of the cache\n // being cleared, so we need to refetch\n refetching = true;\n newState.refetching = refetching;\n loading = true;\n networkStatus = 4;\n // TODO: Move to componentDidUpdate()?\n props.refetch();\n } else {\n // We've received some data that is ready to be rendered\n newState.dataSeen = true;\n newState.data = props.data;\n }\n }\n\n newState.loading = loading;\n newState.networkStatus = networkStatus;\n return newState;\n }","static getDerivedStateFromProps(props, state) {\n if (props.errors !== state.errors) {\n return {\n errors: props.errors,\n };\n }\n\n return null;\n }","static getDerivedStateFromProps(props, currState) {\n if (currState.pageQty !== props.pageQty) {\n return {\n pageQty: props.pageQty,\n range: 0,\n }\n }\n return null\n }","_computeProps() {\n\t for (let i=0; i<this.attributes.length; i++) {\n\t\t const attr = this.attributes[i];\n\t\t if ( ! attr.value) {\n\t\t\t // the attribute has no value but it is present\n\t\t\t // so we assume the prop value is true\n\t\t\t this.props[__camelize(attr.name)] = true\n\t\t\t continue;\n\t\t }\n\t\t // cast the value\n\t\t this.props[__camelize(attr.name)] = __autoCast(attr.value);\n\t }\n\n\t // handle physicalProps\n\t for (let key in this.props) {\n\t\t const value = this.props[key];\n\t\t // handle physical props\n\t\t this._handlePhysicalProps(key, value);\n\t }\n\t}","static getDerivedStateFromProps(props, prevState) { \n console.log('Component WILL RECIEVE PROPS!', props);\n console.log('Component WILL RECIEVE state!', prevState.num);\n // it returns an object to update the state which will update to DOM. \n return {num: props.myNumber1}\n }","static getDerivedStateFromProps(nextProps, prevState){\n return {prompt:'', answer:''}\n }","static getDerivedStateFromProps(props, state) {\n if (props.seed && state.seed !== props.seed && props.seed % 2 !== 0) {\n return {\n seed: props.seed,\n count: props.seed\n }\n }\n return null\n }","static getDerivedStateFromProps(nextProps) {\n //errors are from redux state - mapStateToProps\n if (nextProps.errors) {\n return {\n errors: nextProps.errors\n };\n }\n }","static getDerivedStateFromProps(props, state) {\n if(props.seed && state.seed !== props.seed) {\n return {\n seed: props.seed,\n counter: props.seed\n }\n }\n return null\n }","componentWillReceiveProps (nextProps) {\n if (this.props.worker === undefined && nextProps.worker !== undefined) {\n this.store.setWorker(nextProps.worker);\n }\n\n if (this.props.workerError !== nextProps.workerError) {\n this.store.setWorkerError(nextProps.workerError);\n }\n }","static getDerivedStateFromProps(nextProps) {\n if (nextProps.errors) {\n return { errors: nextProps.errors };\n }\n else return null;\n }","static getDerivedStateFromProps(props, state){\n if(props.infiniteLifespan !== state.infiniteLifespan){ \n return{\n infiniteLifespan: props.infiniteLifespan\n };\n }\n return null;\n}","componentWillReceiveProps(nextProps) { \n //checking for errors in errorsProp\n // errors will now be in state\n if(nextProps.errors) {\n this.setState({errors: nextProps.errors.errors}) \n //.errors.errors because for some reason the errors object is within another set of brackets\n } \n }","static getDerivedStateFromProps(props , state)\n {\n console.log(\"LifeCycleA getDerivedStateFromProps() called\");\n return null;\n }","static getDerivedStateFromProps(props, state) {\n if (props.optsThreeGlobal !== state.optsThreeGlobal && null !== state.optsThreeGlobal) {\n return {optsThreeGlobal: props.optsThreeGlobal};\n }\n return null;\n }","static getDerivedStateFromProps(nextProps, prevState) {\n return nextProps.errors ? { errors: nextProps.errors } : null\n }","static getDerivedStateFromProps(props, state) {\n if (props.workflowId !== state.workflowId) {\n return {\n hasPasswordChecked: false,\n showPasswordChecked: false,\n visible: props.passwordVisible,\n passOption: \"\",\n confirmPassOption: \"\",\n workflowId: props.workflowId\n };\n }\n return null;\n }","static getDerivedStateFromProps(props, state) {\n if (state.prevUsfmStringProp == props.usfmString)\n return null;\n return {\n value: usfmToSlate(props.usfmString),\n prevUsfmStringProp: props.usfmString,\n };\n }","static getDerivedStateFromProps(props, state) {\n console.log(\"getDrivedStateFromProps: Updating state\");\n return null;\n }","componentWillReceiveProps(nextProps) {\r\n // old way, keeping it for now\r\n /*if(nextProps.editedTransaction != null) {\r\n this.setState({\r\n editedTransaction: nextProps.editedTransaction,\r\n isDeposit: nextProps.editedTransaction.isBuy, \r\n amount: nextProps.editedTransaction.baseAmount.toString(),\r\n amountError: null,\r\n currency: this.getSelectObject(nextProps.editedTransaction.pair.base),\r\n currencyError: null,\r\n currencies: nextProps.editedTransaction.isBuy ? this.getDepositCurrencies() : this.getWithdrawalCurrencies(),\r\n date: nextProps.editedTransaction.time,\r\n dateError: null,\r\n comment: nextProps.editedTransaction.comment\r\n });\r\n }\r\n\r\n // track ga\r\n if(nextProps.isDialogShown === true) {\r\n ReactGA.modalview('/#/editFunding');\r\n }*/\r\n }","function mapStateToProps(state,ownProps){\n //debugger;\n return {\n // reselect library memoization\n // in root reducer index.js which return courses\n courses : state.courses\n };\n}","static getDerivedStateFromProps(nextProps, prevState){\n if (nextProps.store !== prevState.lastUser) {\n return {\n name: nextProps.store.name,\n address: nextProps.store.address,\n lastUser: nextProps.store\n } \n }else{\n return null\n } \n }","static getDerivedStateFromProps(props, state){\n console.log('Life Cycle A - getDerivedStateFromProps');\n return null;\n }","componentWillReceiveProps(nextProps) {\r\n let daysSince = nextProps.userModel.getDaysSinceFirstTx();\r\n let portfolios = this.getBestCurrentWorstPortfolio(nextProps, daysSince); \r\n this.setState({\r\n bestPortfolio: portfolios.best,\r\n currentPortfolio: portfolios.current,\r\n worstPortfolio: portfolios.worst,\r\n performanceChartOptions: this.getPerformanceChartOptions(nextProps, portfolios.best, portfolios.current, portfolios.worst)\r\n });\r\n }","componentDidUpdate(prevProps, prevState){\n if(prevProps.previous_workouts !== this.props.reduxStore.previous_workouts){\n console.log(\"inside component did update, if state ment is true, recall render\");\n this.render();\n }\n }","componentWillReceiveProps(nextProps) {\n if (this.props.currentStep !== nextProps.currentStep) {\n this.onUpdateCurrStep(nextProps.currentStep);\n }\n\n this.onUpdateTxHashes(nextProps);\n\n if (this.props.loading && !nextProps.loading) {\n if (nextProps.error) {\n // We had an error\n this.props.showErrorMessage(\n `There was an error deploying the contract: ${nextProps.error}`,\n 8\n );\n } else if (nextProps.contract) {\n // Contract was deployed\n this.props.showSuccessMessage(\n DeployContractSuccess({ contract: nextProps.contract }),\n 5\n );\n }\n }\n }","static getDerivedStateFromProps(nextProps, prevState) {\n if (\n nextProps.src !== prevState.prevSrc ||\n nextProps.name !== prevState.prevName ||\n nextProps.theme !== prevState.prevTheme\n ) {\n // if we pass in new props, we re-validate\n const newPartialState = {\n src: nextProps.src,\n name: nextProps.name,\n theme: nextProps.theme,\n validationMessage: nextProps.validationMessage,\n prevSrc: nextProps.src,\n prevName: nextProps.name,\n prevTheme: nextProps.theme\n };\n return ReactJsonView.validateState(newPartialState);\n }\n return null;\n }","static getDerivedStateFromProps(props, state) {\n if (props.comp && props.comp.length && !state.dataFilled) {\n return {\n pickedChampions: props.comp,\n dataFilled: true\n };\n }\n }"],"string":"[\n \"function memoizeProps(workInProgress, nextProps) {\\n\\t workInProgress.memoizedProps = nextProps;\\n\\t }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"function memoizeProps(workInProgress, nextProps) {\\n workInProgress.memoizedProps = nextProps;\\n }\",\n \"static getDerivedStateFromProps(props, state){\\n if (state.originalResults !== props.results){\\n console.warn('props.results have changed, resetting some state -- ');\\n return {\\n 'results' : props.results.slice(0),\\n 'openDetailPanes' : {},\\n 'originalResults' : props.results\\n };\\n }\\n return null;\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n if (props.errors !== state.errors) {\\n return {\\n errors: props.errors\\n };\\n } else {\\n return null;\\n }\\n }\",\n \"async function tester () {\\n try {\\n var state = await reactDOM.current.stateNode.current.child.memoizedState;\\n } catch(e) {\\n console.log('error: ' + e);\\n }\\n for (let key in state) {\\n if (state[key].constructor === Array) {\\n let arr = state[key];\\n for (let i = 0; i < arr.length; i++) {\\n // console.log(arr[i]);\\n }\\n }\\n }\\n}\",\n \"static getDerivedStateFromProps(props, state) {\\n const newState = {};\\n\\n // These variables are derived from the props\\n let loading = props.loading;\\n let networkStatus = props.networkStatus;\\n\\n // These variables are persisted across re-renders and updated based on\\n // props in this function\\n let refetching = state.refetching;\\n\\n const cacheWasCleared =\\n // It's only possible to clear the cache after data has successfully\\n // loaded at least once\\n state.dataSeen &&\\n // data === null is a valid value and doesn't indicate cache\\n // clearing\\n props.data !== null &&\\n // When cache is cleared, we get back either an empty object or undefined\\n // depending on if it's an item that was cleared or a field on an item.\\n // TODO: Pull the query names out of the `query` prop because a\\n // query might have multiple, but only one was invalidated in the\\n // cache\\n (!props.data || !Object.keys(props.data).length);\\n\\n // There's some legitimate data, so we're not refetching anymore\\n if (refetching && !loading && !cacheWasCleared) {\\n refetching = false;\\n newState.refetching = refetching;\\n }\\n\\n // When the cache is cleared, a re-render is triggered, but it\\n // incorrectly re-renders the component as 'loading: true'.\\n // The canonical Apollo <Query> component re-renders the component as\\n // { loading: false, networkStatus: 4 }, so we emulate that here.\\n if (refetching) {\\n loading = true;\\n networkStatus = 4;\\n }\\n\\n if (!loading) {\\n if (cacheWasCleared) {\\n // We've received some data, but it's the result of the cache\\n // being cleared, so we need to refetch\\n refetching = true;\\n newState.refetching = refetching;\\n loading = true;\\n networkStatus = 4;\\n // TODO: Move to componentDidUpdate()?\\n props.refetch();\\n } else {\\n // We've received some data that is ready to be rendered\\n newState.dataSeen = true;\\n newState.data = props.data;\\n }\\n }\\n\\n newState.loading = loading;\\n newState.networkStatus = networkStatus;\\n return newState;\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n if (props.errors !== state.errors) {\\n return {\\n errors: props.errors,\\n };\\n }\\n\\n return null;\\n }\",\n \"static getDerivedStateFromProps(props, currState) {\\n if (currState.pageQty !== props.pageQty) {\\n return {\\n pageQty: props.pageQty,\\n range: 0,\\n }\\n }\\n return null\\n }\",\n \"_computeProps() {\\n\\t for (let i=0; i<this.attributes.length; i++) {\\n\\t\\t const attr = this.attributes[i];\\n\\t\\t if ( ! attr.value) {\\n\\t\\t\\t // the attribute has no value but it is present\\n\\t\\t\\t // so we assume the prop value is true\\n\\t\\t\\t this.props[__camelize(attr.name)] = true\\n\\t\\t\\t continue;\\n\\t\\t }\\n\\t\\t // cast the value\\n\\t\\t this.props[__camelize(attr.name)] = __autoCast(attr.value);\\n\\t }\\n\\n\\t // handle physicalProps\\n\\t for (let key in this.props) {\\n\\t\\t const value = this.props[key];\\n\\t\\t // handle physical props\\n\\t\\t this._handlePhysicalProps(key, value);\\n\\t }\\n\\t}\",\n \"static getDerivedStateFromProps(props, prevState) { \\n console.log('Component WILL RECIEVE PROPS!', props);\\n console.log('Component WILL RECIEVE state!', prevState.num);\\n // it returns an object to update the state which will update to DOM. \\n return {num: props.myNumber1}\\n }\",\n \"static getDerivedStateFromProps(nextProps, prevState){\\n return {prompt:'', answer:''}\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n if (props.seed && state.seed !== props.seed && props.seed % 2 !== 0) {\\n return {\\n seed: props.seed,\\n count: props.seed\\n }\\n }\\n return null\\n }\",\n \"static getDerivedStateFromProps(nextProps) {\\n //errors are from redux state - mapStateToProps\\n if (nextProps.errors) {\\n return {\\n errors: nextProps.errors\\n };\\n }\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n if(props.seed && state.seed !== props.seed) {\\n return {\\n seed: props.seed,\\n counter: props.seed\\n }\\n }\\n return null\\n }\",\n \"componentWillReceiveProps (nextProps) {\\n if (this.props.worker === undefined && nextProps.worker !== undefined) {\\n this.store.setWorker(nextProps.worker);\\n }\\n\\n if (this.props.workerError !== nextProps.workerError) {\\n this.store.setWorkerError(nextProps.workerError);\\n }\\n }\",\n \"static getDerivedStateFromProps(nextProps) {\\n if (nextProps.errors) {\\n return { errors: nextProps.errors };\\n }\\n else return null;\\n }\",\n \"static getDerivedStateFromProps(props, state){\\n if(props.infiniteLifespan !== state.infiniteLifespan){ \\n return{\\n infiniteLifespan: props.infiniteLifespan\\n };\\n }\\n return null;\\n}\",\n \"componentWillReceiveProps(nextProps) { \\n //checking for errors in errorsProp\\n // errors will now be in state\\n if(nextProps.errors) {\\n this.setState({errors: nextProps.errors.errors}) \\n //.errors.errors because for some reason the errors object is within another set of brackets\\n } \\n }\",\n \"static getDerivedStateFromProps(props , state)\\n {\\n console.log(\\\"LifeCycleA getDerivedStateFromProps() called\\\");\\n return null;\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n if (props.optsThreeGlobal !== state.optsThreeGlobal && null !== state.optsThreeGlobal) {\\n return {optsThreeGlobal: props.optsThreeGlobal};\\n }\\n return null;\\n }\",\n \"static getDerivedStateFromProps(nextProps, prevState) {\\n return nextProps.errors ? { errors: nextProps.errors } : null\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n if (props.workflowId !== state.workflowId) {\\n return {\\n hasPasswordChecked: false,\\n showPasswordChecked: false,\\n visible: props.passwordVisible,\\n passOption: \\\"\\\",\\n confirmPassOption: \\\"\\\",\\n workflowId: props.workflowId\\n };\\n }\\n return null;\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n if (state.prevUsfmStringProp == props.usfmString)\\n return null;\\n return {\\n value: usfmToSlate(props.usfmString),\\n prevUsfmStringProp: props.usfmString,\\n };\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n console.log(\\\"getDrivedStateFromProps: Updating state\\\");\\n return null;\\n }\",\n \"componentWillReceiveProps(nextProps) {\\r\\n // old way, keeping it for now\\r\\n /*if(nextProps.editedTransaction != null) {\\r\\n this.setState({\\r\\n editedTransaction: nextProps.editedTransaction,\\r\\n isDeposit: nextProps.editedTransaction.isBuy, \\r\\n amount: nextProps.editedTransaction.baseAmount.toString(),\\r\\n amountError: null,\\r\\n currency: this.getSelectObject(nextProps.editedTransaction.pair.base),\\r\\n currencyError: null,\\r\\n currencies: nextProps.editedTransaction.isBuy ? this.getDepositCurrencies() : this.getWithdrawalCurrencies(),\\r\\n date: nextProps.editedTransaction.time,\\r\\n dateError: null,\\r\\n comment: nextProps.editedTransaction.comment\\r\\n });\\r\\n }\\r\\n\\r\\n // track ga\\r\\n if(nextProps.isDialogShown === true) {\\r\\n ReactGA.modalview('/#/editFunding');\\r\\n }*/\\r\\n }\",\n \"function mapStateToProps(state,ownProps){\\n //debugger;\\n return {\\n // reselect library memoization\\n // in root reducer index.js which return courses\\n courses : state.courses\\n };\\n}\",\n \"static getDerivedStateFromProps(nextProps, prevState){\\n if (nextProps.store !== prevState.lastUser) {\\n return {\\n name: nextProps.store.name,\\n address: nextProps.store.address,\\n lastUser: nextProps.store\\n } \\n }else{\\n return null\\n } \\n }\",\n \"static getDerivedStateFromProps(props, state){\\n console.log('Life Cycle A - getDerivedStateFromProps');\\n return null;\\n }\",\n \"componentWillReceiveProps(nextProps) {\\r\\n let daysSince = nextProps.userModel.getDaysSinceFirstTx();\\r\\n let portfolios = this.getBestCurrentWorstPortfolio(nextProps, daysSince); \\r\\n this.setState({\\r\\n bestPortfolio: portfolios.best,\\r\\n currentPortfolio: portfolios.current,\\r\\n worstPortfolio: portfolios.worst,\\r\\n performanceChartOptions: this.getPerformanceChartOptions(nextProps, portfolios.best, portfolios.current, portfolios.worst)\\r\\n });\\r\\n }\",\n \"componentDidUpdate(prevProps, prevState){\\n if(prevProps.previous_workouts !== this.props.reduxStore.previous_workouts){\\n console.log(\\\"inside component did update, if state ment is true, recall render\\\");\\n this.render();\\n }\\n }\",\n \"componentWillReceiveProps(nextProps) {\\n if (this.props.currentStep !== nextProps.currentStep) {\\n this.onUpdateCurrStep(nextProps.currentStep);\\n }\\n\\n this.onUpdateTxHashes(nextProps);\\n\\n if (this.props.loading && !nextProps.loading) {\\n if (nextProps.error) {\\n // We had an error\\n this.props.showErrorMessage(\\n `There was an error deploying the contract: ${nextProps.error}`,\\n 8\\n );\\n } else if (nextProps.contract) {\\n // Contract was deployed\\n this.props.showSuccessMessage(\\n DeployContractSuccess({ contract: nextProps.contract }),\\n 5\\n );\\n }\\n }\\n }\",\n \"static getDerivedStateFromProps(nextProps, prevState) {\\n if (\\n nextProps.src !== prevState.prevSrc ||\\n nextProps.name !== prevState.prevName ||\\n nextProps.theme !== prevState.prevTheme\\n ) {\\n // if we pass in new props, we re-validate\\n const newPartialState = {\\n src: nextProps.src,\\n name: nextProps.name,\\n theme: nextProps.theme,\\n validationMessage: nextProps.validationMessage,\\n prevSrc: nextProps.src,\\n prevName: nextProps.name,\\n prevTheme: nextProps.theme\\n };\\n return ReactJsonView.validateState(newPartialState);\\n }\\n return null;\\n }\",\n \"static getDerivedStateFromProps(props, state) {\\n if (props.comp && props.comp.length && !state.dataFilled) {\\n return {\\n pickedChampions: props.comp,\\n dataFilled: true\\n };\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.67638755","0.6755903","0.6748187","0.6748187","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.6717509","0.66943246","0.6609762","0.60271794","0.5585207","0.55785733","0.55745023","0.55295014","0.55189687","0.54561865","0.54196733","0.54185873","0.54102784","0.5386041","0.53821605","0.53707933","0.53269386","0.5320181","0.5307153","0.5278737","0.5256534","0.5249448","0.5242725","0.5239616","0.5228658","0.5224752","0.52102554","0.51960886","0.51958156","0.51922303","0.51918495","0.5186693","0.5186065","0.51784444"],"string":"[\n \"0.67638755\",\n \"0.6755903\",\n \"0.6748187\",\n \"0.6748187\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.6717509\",\n \"0.66943246\",\n \"0.6609762\",\n \"0.60271794\",\n \"0.5585207\",\n \"0.55785733\",\n \"0.55745023\",\n \"0.55295014\",\n \"0.55189687\",\n \"0.54561865\",\n \"0.54196733\",\n \"0.54185873\",\n \"0.54102784\",\n \"0.5386041\",\n \"0.53821605\",\n \"0.53707933\",\n \"0.53269386\",\n \"0.5320181\",\n \"0.5307153\",\n \"0.5278737\",\n \"0.5256534\",\n \"0.5249448\",\n \"0.5242725\",\n \"0.5239616\",\n \"0.5228658\",\n \"0.5224752\",\n \"0.52102554\",\n \"0.51960886\",\n \"0.51958156\",\n \"0.51922303\",\n \"0.51918495\",\n \"0.5186693\",\n \"0.5186065\",\n \"0.51784444\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6671089"},"document_rank":{"kind":"string","value":"67"}}},{"rowIdx":5786,"cells":{"query":{"kind":"string","value":"This module is forked in different environments. By default, return `true` to log errors to the console. Forks can return `false` if this isn't desirable."},"document":{"kind":"string","value":"function showErrorDialog(capturedError) {\n return true;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["static runningOnNode ()\n\t\t{ let ud = \"undefined\";\n\n\t\t\tif (typeof process === ud)\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (! process )\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (! process.versions )\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (! process.versions.node )\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (typeof __dirname === ud)\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (typeof __filename === ud)\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (typeof require === ud)\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (require === null)\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (! require.resolve)\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (typeof module === ud)\n\t\t\t{ return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t}","fork() {\n if (!cluster.isMaster) {\n throw new Error('fork must be called on master only');\n }\n\n if (this.started) {\n this._log('Worker already started');\n\n return;\n }\n\n this._log('fork');\n\n this.started = true;\n this.worker = cluster.fork(this.config.env);\n this._listen();\n }","function node_enable() {\n if(typeof process === 'object' && process + '' === '[object process]'){\n return true;\n }\n else{\n return false;\n }\n}","function _node_p(){\n\tvar ret = false;\n\tif( anchor.environment() == 'Node.js' ){ ret = true; }\n\treturn ret;\n }","isRunning() {\n return this._process !== null;\n }","_isValidContext() {\n const isNode = (typeof process !== 'undefined')\n && (typeof process.release !== 'undefined')\n && (process.release.name === 'node');\n return isNode;\n }","function isNodeEnv() {\r\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\r\n}","function isNodeEnv() {\r\n // tslint:disable:strict-type-predicates\r\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\r\n}","function isNodeEnv() {\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\n}","function isNodeEnv() {\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\n}","function isNode() {\n return typeof module !== 'undefined' &&\n module.exports &&\n typeof window === 'undefined';\n}","shouldRunMixDirectly() {\n return this.getElixirExecutableSetting() === \"elixir\";\n }","function isNode(){\r\n\treturn typeof module !== 'undefined' && module.exports;\r\n}","function isNodeEnv() {\n // tslint:disable:strict-type-predicates\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\n}","function isNodeEnv() {\n // tslint:disable:strict-type-predicates\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\n}","function isNode() {\n return (typeof module !== 'undefined' && this.module !== module);\n}","_isInteractive()\n\t\t{\n\t\t\treturn process.stdout.isTTY && !process.env.CI;\n\t\t}","async is_running(name) {\n let ref = this;\n\n let pids = await ref.find_pids(name);\n \n if (pids.length == 0) {\n return false;\n } else {\n return true;\n }\n }","function is_node() {\r\n if (is_node_ === null)\r\n is_node_ = typeof global === \"object\"\r\n && typeof global.process === \"object\"\r\n && typeof global.process.versions === \"object\"\r\n && typeof global.process.versions.node !== \"undefined\";\r\n return is_node_;\r\n}","isRunning() {\n return this.outEnv.isRunning();\n }","isErr() {\n return true;\n }","isProcessableParallel() {\n return false;\n }","function isNodeInstalled() {\n var cmdString = \"node -v\";\n return new Promise(function (resolve, reject) {\n exec(cmdString, (error, stdout) => {\n if (error) {\n return reject(error);\n }\n\n if (stdout.startsWith('v')) {\n return resolve(true);\n }\n\n return resolve(false);\n });\n });\n}","isToplevel() {\n return this.enclosingEnvironment() === null;\n }","function isNodeEnvironment() {\n let isNode = false;\n if (typeof process === 'object') {\n if (typeof process.versions === 'object') {\n if (typeof process.versions.node !== 'undefined') {\n isNode = true;\n }\n }\n }\n return isNode;\n}","function isRunning() {\n return running;\n }","function f() {\n console.log(\"Hello!\");\n return true;\n}","function aiFork() {\n var forks = getForkMoves(data.board, data.player2);\n if (forks.length > 0) {\n var move = pickRandomSpace(forks);\n placeMoveByIndex(move);\n return true;\n }\n return false;\n}","function isNodeModule() {\n // $FlowFixMe - cannot resolve browser property for process.\n return process === \"undefined\" || !process.browser;\n}","function log (msg : string, err : any = false) : boolean {\n\tif (QUIET) return false\n\tif (err) {\n\t\tconsole.error(msg, err)\n\t} else {\n\t\tconsole.log(msg)\n\t}\n\treturn true\n}","function isSomRunning() {\n return isRunning;\n}","function isDevelopment() {\n return new Promise((resolve, reject) => {\n const env = document.querySelectorAll('script[data-env]')[0].dataset.env\n if (env === 'development' || env === 'testing') {\n console.log('env', env)\n resolve(true)\n } else {\n reject(false)\n }\n })\n}","function isRoot() {\n if (!isNode())\n return false;\n return process.getuid() === 0;\n}","function assertNodeEnv() {\r\n return assert(isNode, 'This feature is only available in NodeJS environments');\r\n }","isErr() {\n return false;\n }","function forkWorker() {\n\n var worker = cluster.fork();\n\n worker.on('message', function (msg) {\n\n if (msg.cmd) {\n\n if (msg.cmd == 'workerStarted') {\n\n runningWorkers++;\n\n if (runningWorkers === parseInt(totalWorkers)) {\n console.log(\"Calipso configured for: \".green + (global.process.env.NODE_ENV || 'development') + \" environment.\".green);\n console.log(\"Calipso server running \".green + runningWorkers + \" workers, listening on port: \".green + port);\n }\n\n }\n\n }\n\n });\n\n}","function isProcessSpawnChildOperation(item) {\n return isTrapConditionMet(PROCESS_MAP, \"spawnChild\", item);\n}","function isNodeProcess() {\r\n // Check browser environment.\r\n if (typeof global !== 'object') {\r\n return false;\r\n }\r\n // Check nodejs or React Native environment.\r\n if (Object.prototype.toString.call(global.process) === '[object process]' ||\r\n navigator.product === 'ReactNative') {\r\n return true;\r\n }\r\n}","function IsServerSide() {\r\n return typeof process !== \"undefined\";\r\n }","function h$run(a) {\n ;\n var t = h$fork(a, false);\n h$startMainLoop();\n return t;\n}","function isNodeEnv() {\n\t // explicitly check for browser bundles as those can be optimized statically\n\t // by terser/rollup.\n\t return (\n\t !isBrowserBundle() &&\n\t Object.prototype.toString.call(typeof browser$1$1 !== 'undefined' ? browser$1$1 : 0) === '[object process]'\n\t );\n\t}","function isNodeEnv() {\n // explicitly check for browser bundles as those can be optimized statically\n // by terser/rollup.\n return (\n !isBrowserBundle() &&\n Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]'\n );\n }","static isClocked() {\n // This default value is overridden in the child classes\n // created from HDL files.\n return false;\n }","async function haveChangesOccurred() {\n const parentPackage = core.getInput('parent-package');\n const versionResult = await exec(`npm view ${parentPackage}@latest version`);\n const version = versionResult.stdout.trim();\n const diffResult = await exec(`git diff --stat v${version}..master frontend-shared/`)\n return diffResult.stdout.length > 0;\n}","function checkChild(done) {\n\n // delay to allow time to child.js was killed or it handles the error\n setTimeout(function() {\n if(childError) {\n throw childError;\n }else{\n done();\n }\n }, testTimeout);\n}","static alive () {\n return true;\n }","isUniqueMaster(){\r\n\t\treturn this.isMaster() && this.env == \"Unique\" \r\n\t}","error(error) {\n return true;\n }","function isNodeEnvironment () {\n if (typeof window !== 'undefined' && typeof document !== 'undefined') {\n return false\n }\n return true\n}","function isNodeEnv() {\n // explicitly check for browser bundles as those can be optimized statically\n // by terser/rollup.\n return (\n !env.isBrowserBundle() &&\n Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]'\n );\n}","function isLayer0RunDev() {\n return !isCloud() && !isProductionBuild();\n}","function h$run(a) {\n ;\n var t = h$fork(a, false);\n h$startMainLoop();\n return t;\n}","function primeTests() {\n console.log(isPrime(1), \" -> false\");\n console.log(isPrime(2), \" -> true\");\n console.log(isPrime(3), \" -> true\");\n console.log(isPrime(4), \" -> false\");\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","_verifyNpmLoginState() {\n var _a;\n return tslib.__awaiter(this, void 0, void 0, function* () {\n const registry = `NPM at the ${(_a = this._config.publishRegistry) !== null && _a !== void 0 ? _a : 'default NPM'} registry`;\n if (yield npmIsLoggedIn(this._config.publishRegistry)) {\n debug(`Already logged into ${registry}.`);\n return true;\n }\n error(red(` ✘ Not currently logged into ${registry}.`));\n const shouldLogin = yield promptConfirm('Would you like to log into NPM now?');\n if (shouldLogin) {\n debug('Starting NPM login.');\n try {\n yield npmLogin(this._config.publishRegistry);\n }\n catch (_b) {\n return false;\n }\n return true;\n }\n return false;\n });\n }","function isDevMode() {\n _runModeLocked = true;\n return _devMode;\n}","function isCI (env) {\n return !!env.CI;\n}","_is_localhost() {\n return ['127.0.0.1','localhost', os.hostname()].includes(this.settings.clamdscan.host);\n }","function useColors() {\n return 'colors' in exports.inspectOpts ?\n Boolean(exports.inspectOpts.colors) :\n tty.isatty(process.stderr.fd);\n}","function isStandalone() {\r\n return !isEmbedded();\r\n }","function browserContext() {\n if (typeof window === 'undefined') return false;\n return true;\n}","function spawnChild()\n{\n\tvar janitor = child_process.fork( libpath.resolve(__dirname,'clean-avatars.js'), {\n\t\tsilent: true\n\t});\n\n\tvar logfile = fs.createWriteStream(libpath.resolve(__dirname,'..','janitor.log'), {flags: 'a'});\n\tjanitor.stdout.on('data', function(chunk){\n\t\tlogfile.write(chunk);\n\t});\n\tjanitor.stdout.on('end', function(){\n\t\tlogfile.end();\n\t});\n}","function isWorkerEnv(){return typeof self!=='undefined'&&typeof DedicatedWorkerGlobalScope!=='undefined'&&self instanceof DedicatedWorkerGlobalScope;}","function isDevelopment () {\n const { NODE_ENV = 'development' } = process.env\n return NODE_ENV === 'development'\n}","function isDev() {\n return process.env.NODE_ENV === 'development' ||\n process.env.NODE_ENV === 'test';\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}","function useColors() {\n return 'colors' in exports.inspectOpts\n ? Boolean(exports.inspectOpts.colors)\n : tty.isatty(process.stderr.fd);\n}"],"string":"[\n \"static runningOnNode ()\\n\\t\\t{ let ud = \\\"undefined\\\";\\n\\n\\t\\t\\tif (typeof process === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (! process )\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (! process.versions )\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (! process.versions.node )\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (typeof __dirname === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (typeof __filename === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (typeof require === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (require === null)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (! require.resolve)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\tif (typeof module === ud)\\n\\t\\t\\t{ return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"fork() {\\n if (!cluster.isMaster) {\\n throw new Error('fork must be called on master only');\\n }\\n\\n if (this.started) {\\n this._log('Worker already started');\\n\\n return;\\n }\\n\\n this._log('fork');\\n\\n this.started = true;\\n this.worker = cluster.fork(this.config.env);\\n this._listen();\\n }\",\n \"function node_enable() {\\n if(typeof process === 'object' && process + '' === '[object process]'){\\n return true;\\n }\\n else{\\n return false;\\n }\\n}\",\n \"function _node_p(){\\n\\tvar ret = false;\\n\\tif( anchor.environment() == 'Node.js' ){ ret = true; }\\n\\treturn ret;\\n }\",\n \"isRunning() {\\n return this._process !== null;\\n }\",\n \"_isValidContext() {\\n const isNode = (typeof process !== 'undefined')\\n && (typeof process.release !== 'undefined')\\n && (process.release.name === 'node');\\n return isNode;\\n }\",\n \"function isNodeEnv() {\\r\\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\\r\\n}\",\n \"function isNodeEnv() {\\r\\n // tslint:disable:strict-type-predicates\\r\\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\\r\\n}\",\n \"function isNodeEnv() {\\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\\n}\",\n \"function isNodeEnv() {\\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\\n}\",\n \"function isNode() {\\n return typeof module !== 'undefined' &&\\n module.exports &&\\n typeof window === 'undefined';\\n}\",\n \"shouldRunMixDirectly() {\\n return this.getElixirExecutableSetting() === \\\"elixir\\\";\\n }\",\n \"function isNode(){\\r\\n\\treturn typeof module !== 'undefined' && module.exports;\\r\\n}\",\n \"function isNodeEnv() {\\n // tslint:disable:strict-type-predicates\\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\\n}\",\n \"function isNodeEnv() {\\n // tslint:disable:strict-type-predicates\\n return Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]';\\n}\",\n \"function isNode() {\\n return (typeof module !== 'undefined' && this.module !== module);\\n}\",\n \"_isInteractive()\\n\\t\\t{\\n\\t\\t\\treturn process.stdout.isTTY && !process.env.CI;\\n\\t\\t}\",\n \"async is_running(name) {\\n let ref = this;\\n\\n let pids = await ref.find_pids(name);\\n \\n if (pids.length == 0) {\\n return false;\\n } else {\\n return true;\\n }\\n }\",\n \"function is_node() {\\r\\n if (is_node_ === null)\\r\\n is_node_ = typeof global === \\\"object\\\"\\r\\n && typeof global.process === \\\"object\\\"\\r\\n && typeof global.process.versions === \\\"object\\\"\\r\\n && typeof global.process.versions.node !== \\\"undefined\\\";\\r\\n return is_node_;\\r\\n}\",\n \"isRunning() {\\n return this.outEnv.isRunning();\\n }\",\n \"isErr() {\\n return true;\\n }\",\n \"isProcessableParallel() {\\n return false;\\n }\",\n \"function isNodeInstalled() {\\n var cmdString = \\\"node -v\\\";\\n return new Promise(function (resolve, reject) {\\n exec(cmdString, (error, stdout) => {\\n if (error) {\\n return reject(error);\\n }\\n\\n if (stdout.startsWith('v')) {\\n return resolve(true);\\n }\\n\\n return resolve(false);\\n });\\n });\\n}\",\n \"isToplevel() {\\n return this.enclosingEnvironment() === null;\\n }\",\n \"function isNodeEnvironment() {\\n let isNode = false;\\n if (typeof process === 'object') {\\n if (typeof process.versions === 'object') {\\n if (typeof process.versions.node !== 'undefined') {\\n isNode = true;\\n }\\n }\\n }\\n return isNode;\\n}\",\n \"function isRunning() {\\n return running;\\n }\",\n \"function f() {\\n console.log(\\\"Hello!\\\");\\n return true;\\n}\",\n \"function aiFork() {\\n var forks = getForkMoves(data.board, data.player2);\\n if (forks.length > 0) {\\n var move = pickRandomSpace(forks);\\n placeMoveByIndex(move);\\n return true;\\n }\\n return false;\\n}\",\n \"function isNodeModule() {\\n // $FlowFixMe - cannot resolve browser property for process.\\n return process === \\\"undefined\\\" || !process.browser;\\n}\",\n \"function log (msg : string, err : any = false) : boolean {\\n\\tif (QUIET) return false\\n\\tif (err) {\\n\\t\\tconsole.error(msg, err)\\n\\t} else {\\n\\t\\tconsole.log(msg)\\n\\t}\\n\\treturn true\\n}\",\n \"function isSomRunning() {\\n return isRunning;\\n}\",\n \"function isDevelopment() {\\n return new Promise((resolve, reject) => {\\n const env = document.querySelectorAll('script[data-env]')[0].dataset.env\\n if (env === 'development' || env === 'testing') {\\n console.log('env', env)\\n resolve(true)\\n } else {\\n reject(false)\\n }\\n })\\n}\",\n \"function isRoot() {\\n if (!isNode())\\n return false;\\n return process.getuid() === 0;\\n}\",\n \"function assertNodeEnv() {\\r\\n return assert(isNode, 'This feature is only available in NodeJS environments');\\r\\n }\",\n \"isErr() {\\n return false;\\n }\",\n \"function forkWorker() {\\n\\n var worker = cluster.fork();\\n\\n worker.on('message', function (msg) {\\n\\n if (msg.cmd) {\\n\\n if (msg.cmd == 'workerStarted') {\\n\\n runningWorkers++;\\n\\n if (runningWorkers === parseInt(totalWorkers)) {\\n console.log(\\\"Calipso configured for: \\\".green + (global.process.env.NODE_ENV || 'development') + \\\" environment.\\\".green);\\n console.log(\\\"Calipso server running \\\".green + runningWorkers + \\\" workers, listening on port: \\\".green + port);\\n }\\n\\n }\\n\\n }\\n\\n });\\n\\n}\",\n \"function isProcessSpawnChildOperation(item) {\\n return isTrapConditionMet(PROCESS_MAP, \\\"spawnChild\\\", item);\\n}\",\n \"function isNodeProcess() {\\r\\n // Check browser environment.\\r\\n if (typeof global !== 'object') {\\r\\n return false;\\r\\n }\\r\\n // Check nodejs or React Native environment.\\r\\n if (Object.prototype.toString.call(global.process) === '[object process]' ||\\r\\n navigator.product === 'ReactNative') {\\r\\n return true;\\r\\n }\\r\\n}\",\n \"function IsServerSide() {\\r\\n return typeof process !== \\\"undefined\\\";\\r\\n }\",\n \"function h$run(a) {\\n ;\\n var t = h$fork(a, false);\\n h$startMainLoop();\\n return t;\\n}\",\n \"function isNodeEnv() {\\n\\t // explicitly check for browser bundles as those can be optimized statically\\n\\t // by terser/rollup.\\n\\t return (\\n\\t !isBrowserBundle() &&\\n\\t Object.prototype.toString.call(typeof browser$1$1 !== 'undefined' ? browser$1$1 : 0) === '[object process]'\\n\\t );\\n\\t}\",\n \"function isNodeEnv() {\\n // explicitly check for browser bundles as those can be optimized statically\\n // by terser/rollup.\\n return (\\n !isBrowserBundle() &&\\n Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]'\\n );\\n }\",\n \"static isClocked() {\\n // This default value is overridden in the child classes\\n // created from HDL files.\\n return false;\\n }\",\n \"async function haveChangesOccurred() {\\n const parentPackage = core.getInput('parent-package');\\n const versionResult = await exec(`npm view ${parentPackage}@latest version`);\\n const version = versionResult.stdout.trim();\\n const diffResult = await exec(`git diff --stat v${version}..master frontend-shared/`)\\n return diffResult.stdout.length > 0;\\n}\",\n \"function checkChild(done) {\\n\\n // delay to allow time to child.js was killed or it handles the error\\n setTimeout(function() {\\n if(childError) {\\n throw childError;\\n }else{\\n done();\\n }\\n }, testTimeout);\\n}\",\n \"static alive () {\\n return true;\\n }\",\n \"isUniqueMaster(){\\r\\n\\t\\treturn this.isMaster() && this.env == \\\"Unique\\\" \\r\\n\\t}\",\n \"error(error) {\\n return true;\\n }\",\n \"function isNodeEnvironment () {\\n if (typeof window !== 'undefined' && typeof document !== 'undefined') {\\n return false\\n }\\n return true\\n}\",\n \"function isNodeEnv() {\\n // explicitly check for browser bundles as those can be optimized statically\\n // by terser/rollup.\\n return (\\n !env.isBrowserBundle() &&\\n Object.prototype.toString.call(typeof process !== 'undefined' ? process : 0) === '[object process]'\\n );\\n}\",\n \"function isLayer0RunDev() {\\n return !isCloud() && !isProductionBuild();\\n}\",\n \"function h$run(a) {\\n ;\\n var t = h$fork(a, false);\\n h$startMainLoop();\\n return t;\\n}\",\n \"function primeTests() {\\n console.log(isPrime(1), \\\" -> false\\\");\\n console.log(isPrime(2), \\\" -> true\\\");\\n console.log(isPrime(3), \\\" -> true\\\");\\n console.log(isPrime(4), \\\" -> false\\\");\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"_verifyNpmLoginState() {\\n var _a;\\n return tslib.__awaiter(this, void 0, void 0, function* () {\\n const registry = `NPM at the ${(_a = this._config.publishRegistry) !== null && _a !== void 0 ? _a : 'default NPM'} registry`;\\n if (yield npmIsLoggedIn(this._config.publishRegistry)) {\\n debug(`Already logged into ${registry}.`);\\n return true;\\n }\\n error(red(` ✘ Not currently logged into ${registry}.`));\\n const shouldLogin = yield promptConfirm('Would you like to log into NPM now?');\\n if (shouldLogin) {\\n debug('Starting NPM login.');\\n try {\\n yield npmLogin(this._config.publishRegistry);\\n }\\n catch (_b) {\\n return false;\\n }\\n return true;\\n }\\n return false;\\n });\\n }\",\n \"function isDevMode() {\\n _runModeLocked = true;\\n return _devMode;\\n}\",\n \"function isCI (env) {\\n return !!env.CI;\\n}\",\n \"_is_localhost() {\\n return ['127.0.0.1','localhost', os.hostname()].includes(this.settings.clamdscan.host);\\n }\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ?\\n Boolean(exports.inspectOpts.colors) :\\n tty.isatty(process.stderr.fd);\\n}\",\n \"function isStandalone() {\\r\\n return !isEmbedded();\\r\\n }\",\n \"function browserContext() {\\n if (typeof window === 'undefined') return false;\\n return true;\\n}\",\n \"function spawnChild()\\n{\\n\\tvar janitor = child_process.fork( libpath.resolve(__dirname,'clean-avatars.js'), {\\n\\t\\tsilent: true\\n\\t});\\n\\n\\tvar logfile = fs.createWriteStream(libpath.resolve(__dirname,'..','janitor.log'), {flags: 'a'});\\n\\tjanitor.stdout.on('data', function(chunk){\\n\\t\\tlogfile.write(chunk);\\n\\t});\\n\\tjanitor.stdout.on('end', function(){\\n\\t\\tlogfile.end();\\n\\t});\\n}\",\n \"function isWorkerEnv(){return typeof self!=='undefined'&&typeof DedicatedWorkerGlobalScope!=='undefined'&&self instanceof DedicatedWorkerGlobalScope;}\",\n \"function isDevelopment () {\\n const { NODE_ENV = 'development' } = process.env\\n return NODE_ENV === 'development'\\n}\",\n \"function isDev() {\\n return process.env.NODE_ENV === 'development' ||\\n process.env.NODE_ENV === 'test';\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts ? Boolean(exports.inspectOpts.colors) : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\",\n \"function useColors() {\\n return 'colors' in exports.inspectOpts\\n ? Boolean(exports.inspectOpts.colors)\\n : tty.isatty(process.stderr.fd);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6476742","0.59491473","0.584118","0.5588432","0.5582435","0.54698336","0.54398966","0.5429671","0.5409681","0.5409681","0.5398092","0.5377223","0.53769946","0.5359536","0.5359536","0.53345436","0.52284026","0.5201319","0.5185094","0.51222306","0.5118625","0.5075323","0.503386","0.5021073","0.5011358","0.501084","0.50085735","0.5007493","0.5006367","0.50054276","0.49740198","0.49620134","0.4955918","0.49358732","0.49324918","0.49291363","0.49194437","0.49155378","0.490926","0.489679","0.48688442","0.48504186","0.4845656","0.48416218","0.48386443","0.4834498","0.48326588","0.48321694","0.48206922","0.4816123","0.48126882","0.4811728","0.4787092","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.47763082","0.4750432","0.4749794","0.47346222","0.47344998","0.47277108","0.4711754","0.47041428","0.46997935","0.46955547","0.46810406","0.4679778","0.46766493","0.46766493","0.46766493","0.46766493","0.46766493","0.46766493","0.46766493","0.46766493","0.46766493","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356","0.46744356"],"string":"[\n \"0.6476742\",\n \"0.59491473\",\n \"0.584118\",\n \"0.5588432\",\n \"0.5582435\",\n \"0.54698336\",\n \"0.54398966\",\n \"0.5429671\",\n \"0.5409681\",\n \"0.5409681\",\n \"0.5398092\",\n \"0.5377223\",\n \"0.53769946\",\n \"0.5359536\",\n \"0.5359536\",\n \"0.53345436\",\n \"0.52284026\",\n \"0.5201319\",\n \"0.5185094\",\n \"0.51222306\",\n \"0.5118625\",\n \"0.5075323\",\n \"0.503386\",\n \"0.5021073\",\n \"0.5011358\",\n \"0.501084\",\n \"0.50085735\",\n \"0.5007493\",\n \"0.5006367\",\n \"0.50054276\",\n \"0.49740198\",\n \"0.49620134\",\n \"0.4955918\",\n \"0.49358732\",\n \"0.49324918\",\n \"0.49291363\",\n \"0.49194437\",\n \"0.49155378\",\n \"0.490926\",\n \"0.489679\",\n \"0.48688442\",\n \"0.48504186\",\n \"0.4845656\",\n \"0.48416218\",\n \"0.48386443\",\n \"0.4834498\",\n \"0.48326588\",\n \"0.48321694\",\n \"0.48206922\",\n \"0.4816123\",\n \"0.48126882\",\n \"0.4811728\",\n \"0.4787092\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.47763082\",\n \"0.4750432\",\n \"0.4749794\",\n \"0.47346222\",\n \"0.47344998\",\n \"0.47277108\",\n \"0.4711754\",\n \"0.47041428\",\n \"0.46997935\",\n \"0.46955547\",\n \"0.46810406\",\n \"0.4679778\",\n \"0.46766493\",\n \"0.46766493\",\n \"0.46766493\",\n \"0.46766493\",\n \"0.46766493\",\n \"0.46766493\",\n \"0.46766493\",\n \"0.46766493\",\n \"0.46766493\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\",\n \"0.46744356\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5787,"cells":{"query":{"kind":"string","value":"Capture errors so they don't interrupt unmounting."},"document":{"kind":"string","value":"function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$3(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureCommitPhaseError(current, unmountError);\n }\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["simulateUnmount() {\n this.volumeUnmountListener(this.volumeInfo_.volumeId);\n }","function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)errorOrDestroy(dest,er);}// Make sure our error handler is attached before userland ones.","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$2(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$2(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$2(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureError(current,unmountError);}}}","componentWillUnmount() {\n window.removeEventListener(\"unhandledrejection\", this.handleAllUncaughtErrors)\n }","function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)dest.emit('error',er);}// Make sure our error handler is attached before userland ones.","function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)dest.emit('error',er);}// Make sure our error handler is attached before userland ones.","function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)dest.emit('error',er);}// Make sure our error handler is attached before userland ones.","componentWillUnmount() {\n if (this.props.error) {\n this.props.removeError();\n }\n }","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}","function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}","function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$3(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$3(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureCommitPhaseError(current,unmountError);}}}","_onError(e) {\n console.log(`Filer filesystem error: ${e}`);\n }","function flushMounts() {\n\tvar c;\n\twhile (c = mounts.pop()) {\n\t\tif (options.afterMount) options.afterMount(c);\n\t\tif (c.componentDidMount) c.componentDidMount();\n\t}\n}","function flushMounts() {\n\tvar c;\n\twhile (c = mounts.pop()) {\n\t\tif (options.afterMount) options.afterMount(c);\n\t\tif (c.componentDidMount) c.componentDidMount();\n\t}\n}","function flushMounts() {\n\tvar c;\n\twhile (c = mounts.pop()) {\n\t\tif (options.afterMount) options.afterMount(c);\n\t\tif (c.componentDidMount) c.componentDidMount();\n\t}\n}","function flushMounts() {\n\tvar c;\n\twhile (c = mounts.pop()) {\n\t\tif (options.afterMount) options.afterMount(c);\n\t\tif (c.componentDidMount) c.componentDidMount();\n\t}\n}","function flushMounts() {\n\tvar c;\n\twhile (c = mounts.pop()) {\n\t\tif (options.afterMount) options.afterMount(c);\n\t\tif (c.componentDidMount) c.componentDidMount();\n\t}\n}","function flushMounts() {\n\tvar c;\n\twhile (c = mounts.pop()) {\n\t\tif (options.afterMount) options.afterMount(c);\n\t\tif (c.componentDidMount) c.componentDidMount();\n\t}\n}","_onError(error) {\n values(this._watcherMap).forEach(watcherInfo =>\n watcherInfo.watchmanWatcher.handleErrorEvent(error)\n );\n }","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\n } // Make sure our error handler is attached before userland ones.","onError_() {\n this.switchScreen_(Screens.ERROR);\n getParentAccessUIHandler().onParentAccessDone(ParentAccessResult.kError);\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n\t {\n\t invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n\t if (hasCaughtError$1()) {\n\t var unmountError = clearCaughtError$1();\n\t captureError(current, unmountError);\n\t }\n\t }\n\t }","function safelyCallComponentWillUnmount(current$$1, instance) {\n {\n invokeGuardedCallback(null, callComponentWillUnmountWithTimer, null, current$$1, instance);\n\n if (hasCaughtError()) {\n var unmountError = clearCaughtError();\n captureCommitPhaseError(current$$1, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current$$1, instance) {\n {\n invokeGuardedCallback(null, callComponentWillUnmountWithTimer, null, current$$1, instance);\n\n if (hasCaughtError()) {\n var unmountError = clearCaughtError();\n captureCommitPhaseError(current$$1, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current$$1, instance) {\n {\n invokeGuardedCallback(null, callComponentWillUnmountWithTimer, null, current$$1, instance);\n\n if (hasCaughtError()) {\n var unmountError = clearCaughtError();\n captureCommitPhaseError(current$$1, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current$$1, instance) {\n {\n invokeGuardedCallback(null, callComponentWillUnmountWithTimer, null, current$$1, instance);\n\n if (hasCaughtError()) {\n var unmountError = clearCaughtError();\n captureCommitPhaseError(current$$1, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function onerror(er) {\n debug('onerror', er);\n unpipe();\n dest.removeListener('error', onerror);\n if (dest.listenerCount('error') === 0) {\n const s = dest._writableState || dest._readableState;\n if (s && !s.errorEmitted) {\n // User incorrectly emitted 'error' directly on the stream.\n errorOrDestroy(dest, er);\n } else {\n dest.emit('error', er);\n }\n }\n } // Make sure our error handler is attached before userland ones.","function onerror(er) {\n\t debug$2('onerror', er);\n\t unpipe();\n\t dest.removeListener('error', onerror);\n\t if (EElistenerCount(dest, 'error') === 0) errorOrDestroy$2(dest, er);\n\t } // Make sure our error handler is attached before userland ones.","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }","function safelyCallComponentWillUnmount(current, instance) {\n {\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\n if (hasCaughtError$1()) {\n var unmountError = clearCaughtError$1();\n captureError(current, unmountError);\n }\n }\n }"],"string":"[\n \"simulateUnmount() {\\n this.volumeUnmountListener(this.volumeInfo_.volumeId);\\n }\",\n \"function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)errorOrDestroy(dest,er);}// Make sure our error handler is attached before userland ones.\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$2(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$2(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$2(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureError(current,unmountError);}}}\",\n \"componentWillUnmount() {\\n window.removeEventListener(\\\"unhandledrejection\\\", this.handleAllUncaughtErrors)\\n }\",\n \"function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)dest.emit('error',er);}// Make sure our error handler is attached before userland ones.\",\n \"function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)dest.emit('error',er);}// Make sure our error handler is attached before userland ones.\",\n \"function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)dest.emit('error',er);}// Make sure our error handler is attached before userland ones.\",\n \"componentWillUnmount() {\\n if (this.props.error) {\\n this.props.removeError();\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$3(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$3(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureCommitPhaseError(current,unmountError);}}}\",\n \"_onError(e) {\\n console.log(`Filer filesystem error: ${e}`);\\n }\",\n \"function flushMounts() {\\n\\tvar c;\\n\\twhile (c = mounts.pop()) {\\n\\t\\tif (options.afterMount) options.afterMount(c);\\n\\t\\tif (c.componentDidMount) c.componentDidMount();\\n\\t}\\n}\",\n \"function flushMounts() {\\n\\tvar c;\\n\\twhile (c = mounts.pop()) {\\n\\t\\tif (options.afterMount) options.afterMount(c);\\n\\t\\tif (c.componentDidMount) c.componentDidMount();\\n\\t}\\n}\",\n \"function flushMounts() {\\n\\tvar c;\\n\\twhile (c = mounts.pop()) {\\n\\t\\tif (options.afterMount) options.afterMount(c);\\n\\t\\tif (c.componentDidMount) c.componentDidMount();\\n\\t}\\n}\",\n \"function flushMounts() {\\n\\tvar c;\\n\\twhile (c = mounts.pop()) {\\n\\t\\tif (options.afterMount) options.afterMount(c);\\n\\t\\tif (c.componentDidMount) c.componentDidMount();\\n\\t}\\n}\",\n \"function flushMounts() {\\n\\tvar c;\\n\\twhile (c = mounts.pop()) {\\n\\t\\tif (options.afterMount) options.afterMount(c);\\n\\t\\tif (c.componentDidMount) c.componentDidMount();\\n\\t}\\n}\",\n \"function flushMounts() {\\n\\tvar c;\\n\\twhile (c = mounts.pop()) {\\n\\t\\tif (options.afterMount) options.afterMount(c);\\n\\t\\tif (c.componentDidMount) c.componentDidMount();\\n\\t}\\n}\",\n \"_onError(error) {\\n values(this._watcherMap).forEach(watcherInfo =>\\n watcherInfo.watchmanWatcher.handleErrorEvent(error)\\n );\\n }\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er);\\n } // Make sure our error handler is attached before userland ones.\",\n \"onError_() {\\n this.switchScreen_(Screens.ERROR);\\n getParentAccessUIHandler().onParentAccessDone(ParentAccessResult.kError);\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n\\t {\\n\\t invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n\\t if (hasCaughtError$1()) {\\n\\t var unmountError = clearCaughtError$1();\\n\\t captureError(current, unmountError);\\n\\t }\\n\\t }\\n\\t }\",\n \"function safelyCallComponentWillUnmount(current$$1, instance) {\\n {\\n invokeGuardedCallback(null, callComponentWillUnmountWithTimer, null, current$$1, instance);\\n\\n if (hasCaughtError()) {\\n var unmountError = clearCaughtError();\\n captureCommitPhaseError(current$$1, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current$$1, instance) {\\n {\\n invokeGuardedCallback(null, callComponentWillUnmountWithTimer, null, current$$1, instance);\\n\\n if (hasCaughtError()) {\\n var unmountError = clearCaughtError();\\n captureCommitPhaseError(current$$1, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current$$1, instance) {\\n {\\n invokeGuardedCallback(null, callComponentWillUnmountWithTimer, null, current$$1, instance);\\n\\n if (hasCaughtError()) {\\n var unmountError = clearCaughtError();\\n captureCommitPhaseError(current$$1, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current$$1, instance) {\\n {\\n invokeGuardedCallback(null, callComponentWillUnmountWithTimer, null, current$$1, instance);\\n\\n if (hasCaughtError()) {\\n var unmountError = clearCaughtError();\\n captureCommitPhaseError(current$$1, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimerInDev, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function onerror(er) {\\n debug('onerror', er);\\n unpipe();\\n dest.removeListener('error', onerror);\\n if (dest.listenerCount('error') === 0) {\\n const s = dest._writableState || dest._readableState;\\n if (s && !s.errorEmitted) {\\n // User incorrectly emitted 'error' directly on the stream.\\n errorOrDestroy(dest, er);\\n } else {\\n dest.emit('error', er);\\n }\\n }\\n } // Make sure our error handler is attached before userland ones.\",\n \"function onerror(er) {\\n\\t debug$2('onerror', er);\\n\\t unpipe();\\n\\t dest.removeListener('error', onerror);\\n\\t if (EElistenerCount(dest, 'error') === 0) errorOrDestroy$2(dest, er);\\n\\t } // Make sure our error handler is attached before userland ones.\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\",\n \"function safelyCallComponentWillUnmount(current, instance) {\\n {\\n invokeGuardedCallback$2(null, callComponentWillUnmountWithTimer, null, current, instance);\\n if (hasCaughtError$1()) {\\n var unmountError = clearCaughtError$1();\\n captureError(current, unmountError);\\n }\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6385105","0.5921357","0.5853079","0.5853079","0.5853079","0.58470565","0.58197415","0.58197415","0.58197415","0.57672554","0.5742686","0.5742686","0.5742686","0.5742686","0.5742686","0.57321393","0.57321393","0.57321393","0.5689659","0.5689659","0.5657255","0.56402457","0.56402457","0.56402457","0.56402457","0.56402457","0.56402457","0.56064075","0.55910873","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5590156","0.5589521","0.55695796","0.55695796","0.5558446","0.55567133","0.55567133","0.55567133","0.55567133","0.55494034","0.55494034","0.55494034","0.55494034","0.55494034","0.55494034","0.55478126","0.55453753","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225","0.5536225"],"string":"[\n \"0.6385105\",\n \"0.5921357\",\n \"0.5853079\",\n \"0.5853079\",\n \"0.5853079\",\n \"0.58470565\",\n \"0.58197415\",\n \"0.58197415\",\n \"0.58197415\",\n \"0.57672554\",\n \"0.5742686\",\n \"0.5742686\",\n \"0.5742686\",\n \"0.5742686\",\n \"0.5742686\",\n \"0.57321393\",\n \"0.57321393\",\n \"0.57321393\",\n \"0.5689659\",\n \"0.5689659\",\n \"0.5657255\",\n \"0.56402457\",\n \"0.56402457\",\n \"0.56402457\",\n \"0.56402457\",\n \"0.56402457\",\n \"0.56402457\",\n \"0.56064075\",\n \"0.55910873\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5590156\",\n \"0.5589521\",\n \"0.55695796\",\n \"0.55695796\",\n \"0.5558446\",\n \"0.55567133\",\n \"0.55567133\",\n \"0.55567133\",\n \"0.55567133\",\n \"0.55494034\",\n \"0.55494034\",\n \"0.55494034\",\n \"0.55494034\",\n \"0.55494034\",\n \"0.55494034\",\n \"0.55478126\",\n \"0.55453753\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\",\n \"0.5536225\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5788,"cells":{"query":{"kind":"string","value":"Useroriginating errors (lifecycles and refs) should not interrupt deletion, so don't let them throw. Hostoriginating errors should interrupt deletion, so it's okay"},"document":{"kind":"string","value":"function commitUnmount(current) {\n if (typeof onCommitUnmount === 'function') {\n onCommitUnmount(current);\n }\n\n switch (current.tag) {\n case ClassComponent:\n {\n safelyDetachRef(current);\n var instance = current.stateNode;\n if (typeof instance.componentWillUnmount === 'function') {\n safelyCallComponentWillUnmount(current, instance);\n }\n return;\n }\n case HostComponent:\n {\n safelyDetachRef(current);\n return;\n }\n case HostPortal:\n {\n // TODO: this is recursive.\n // We are also not using this parent because\n // the portal will get pushed immediately.\n if (supportsMutation) {\n unmountHostComponents(current);\n } else if (supportsPersistence) {\n emptyPortalContainer(current);\n }\n return;\n }\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["detach() {\n throw new Error('Not Implemented');\n }","detach() {\n throw new Error('Not Implemented');\n }","function deleteErrHandler(error, result) {\n\tif (error) {\n\t\tlog(\"cannot delete data\")\n\t\tthrow error\n\t} else {\n\t\tlog(\"Delete Success\") \n\t}\n}","componentWillUnmount() {\n window.removeEventListener(\"unhandledrejection\", this.handleAllUncaughtErrors)\n }","function destroyed() {\n throw new Error('Call made to destroyed method');\n}","disconnected() {\n this.unsubscribe?.();\n delete this.unsubscribe;\n delete this.baseObject;\n delete this.property;\n delete this.replica;\n delete this.path;\n }","function _handleRemove() {\n Promise.all(deletePromises).catch(error => console.log(error));\n next(err);\n }","function somethingBad() {\n nock.cleanAll()\n }","function deleteMovieError() {\n console.log('Unble to delete movie...');\n}","async cleanup() {\n // The cleanup logic is as follows:\n // - We first try to delete the resource using the delete() method\n // - However, it is possible that the user that created the resource does not have permission\n // to delete the resource or the user might have become inactive. Because of this we will\n // also try to perform the same delete() method but with default admin credentials\n\n try {\n await this.delete();\n } catch (error) {\n // Now we try with default admin credentials\n const adminSession = await this.setup.defaultAdminSession();\n this.axiosClient = adminSession.axiosClient;\n await this.delete();\n }\n }","detach() {\n throw new Error('incompatible reuse strategy');\n }","function socketError() {\n this.destroy();\n}","function socketError () {\n this.destroy();\n}","function socketError () {\n this.destroy();\n}","handleFailure (error_)\n\t{\n\t\t// todo: Undo all actions\n\t\tthis.cleanup ();\n\t\tthrow error_;\n\t}","function onerror(err){\n debug('subscription \"%s\" error %s in pending state', sub.id, err.stack);\n sub.destroy();\n }","componentWillUnmount() {\n if (this.props.error) {\n this.props.removeError();\n }\n }","function socketOnError() {\n this.destroy();\n}","function socketOnError() {\n this.destroy();\n}","function socketOnError() {\n this.destroy();\n}","cleanUpDeadCreeps () {\n }","async abort() {\n return;\n }","function socketOnError () {\n this.destroy();\n}","function socketOnError () {\n this.destroy();\n}","function socketOnError () {\n this.destroy();\n}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}","onFail_() {\n this.canAccess = false;\n }","static actualize() {\n for (let i = 0; i < refs.length ; ++i) {\n const ref = refs[i];\n if (ref.isOutdated()) {\n ref.remove();\n refs.splice(i--, 1);\n }\n }\n }","function socketError () {\n\t this.destroy();\n\t}","function socketError () {\n\t this.destroy();\n\t}","function onFileSystemFail(err) {\n console.log('deleteFileFromPersistentStorage file system fail: ' + fileName);\n console.log('error code = ' + err.code);\n }","remove () {\n // cleanup\n }","function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}","function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}","function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}","function esconderError() {\n setError(null);\n }","destroy (err) {\n this._destroy(err, () => {})\n }","destroy (err) {\n this._destroy(err, () => {})\n }","destroy (err) {\n this._destroy(err, () => {})\n }","destroy (err) {\n this._destroy(err, () => {})\n }","destroy (err) {\n this._destroy(err, () => {})\n }","destroy (err) {\n this._destroy(err, () => {})\n }","function deleteAircraftFailed(err) {\n vm.showDeleteButton = true;\n vm.showUpdateButton = true;\n vm.message = LOGBOOK_CONSTANT.MSG_AIRCRAFT_DELETE_ERROR;\n vm.working = false;\n }","function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)errorOrDestroy(dest,er);}// Make sure our error handler is attached before userland ones.","function failed(e) {\n console.error(e);\n Notification.remove(note_id);\n page(\"/error\");\n note_id = null;\n }","onActivationError() {\n this.removeListeners();\n this.state = State.ERROR;\n this.dispatchEvent(new GoogEvent(EventType.EXECUTED));\n }","function captureError(failedWork, error) {\n // It is no longer valid because we exited the user code.\n ReactCurrentOwner$2.current = null;\n var boundary = null, errorBoundaryFound = !1, willRetry = !1, errorBoundaryName = null;\n // Host containers are a special case. If the failed work itself is a host\n // container, then it acts as its own boundary. In all other cases, we\n // ignore the work itself and only search through the parents.\n if (failedWork.tag === HostRoot$3) boundary = failedWork, isFailedBoundary(failedWork) && (// If this root already failed, there must have been an error when\n // attempting to unmount it. This is a worst-case scenario and\n // should only be possible if there's a bug in the renderer.\n didFatal = !0); else for (var node = failedWork.return; null !== node && null === boundary; ) {\n if (node.tag === ClassComponent$3) {\n var instance = node.stateNode;\n \"function\" == typeof instance.componentDidCatch && (errorBoundaryFound = !0, errorBoundaryName = getComponentName_1(node), \n // Found an error boundary!\n boundary = node, willRetry = !0);\n } else node.tag === HostRoot$3 && (// Treat the root like a no-op error boundary\n boundary = node);\n if (isFailedBoundary(node)) {\n // This boundary is already in a failed state.\n // If we're currently unmounting, that means this error was\n // thrown while unmounting a failed subtree. We should ignore\n // the error.\n if (isUnmounting) return null;\n // If we're in the commit phase, we should check to see if\n // this boundary already captured an error during this commit.\n // This case exists because multiple errors can be thrown during\n // a single commit without interruption.\n if (null !== commitPhaseBoundaries && (commitPhaseBoundaries.has(node) || null !== node.alternate && commitPhaseBoundaries.has(node.alternate))) // If so, we should ignore this error.\n return null;\n // The error should propagate to the next boundary -— we keep looking.\n boundary = null, willRetry = !1;\n }\n node = node.return;\n }\n if (null !== boundary) {\n // Add to the collection of failed boundaries. This lets us know that\n // subsequent errors in this subtree should propagate to the next boundary.\n null === failedBoundaries && (failedBoundaries = new Set()), failedBoundaries.add(boundary);\n // This method is unsafe outside of the begin and complete phases.\n // We might be in the commit phase when an error is captured.\n // The risk is that the return path from this Fiber may not be accurate.\n // That risk is acceptable given the benefit of providing users more context.\n var _componentStack = getStackAddendumByWorkInProgressFiber(failedWork), _componentName = getComponentName_1(failedWork);\n // Add to the collection of captured errors. This is stored as a global\n // map of errors and their component stack location keyed by the boundaries\n // that capture them. We mostly use this Map as a Set; it's a Map only to\n // avoid adding a field to Fiber to store the error.\n null === capturedErrors && (capturedErrors = new Map());\n var capturedError = {\n componentName: _componentName,\n componentStack: _componentStack,\n error: error,\n errorBoundary: errorBoundaryFound ? boundary.stateNode : null,\n errorBoundaryFound: errorBoundaryFound,\n errorBoundaryName: errorBoundaryName,\n willRetry: willRetry\n };\n capturedErrors.set(boundary, capturedError);\n try {\n logCapturedError(capturedError);\n } catch (e) {\n // Prevent cycle if logCapturedError() throws.\n // A cycle may still occur if logCapturedError renders a component that throws.\n console.error(e);\n }\n // If we're in the commit phase, defer scheduling an update on the\n // boundary until after the commit is complete\n // Otherwise, schedule an update now.\n // TODO: Is this actually necessary during the render phase? Is it\n // possible to unwind and continue rendering at the same priority,\n // without corrupting internal state?\n return isCommitting ? (null === commitPhaseBoundaries && (commitPhaseBoundaries = new Set()), \n commitPhaseBoundaries.add(boundary)) : scheduleErrorRecovery(boundary), boundary;\n }\n // If no boundary is found, we'll need to throw the error\n return null === firstUncaughtError && (firstUncaughtError = error), null;\n }","cleanup() {}","cleanup() {}","function onFatal(root){root.finishedWork=null;}","function onFatal(root){root.finishedWork=null;}","function onFatal(root){root.finishedWork=null;}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","function onFatal(root) {\n root.finishedWork = null;\n}","rethrowNonDiagnosticError(error) {\n if (!error.isDiagnostic) {\n throw error;\n }\n }","function throwPortalOutletAlreadyDisposedError() {\n throw Error('This PortalOutlet has already been disposed');\n}","function deleteShelterError(error) {\n vm.error = \"Could not delete shelter at this time. Please try again later.\";\n scrollToError();\n }","abort() {\n const me = this,\n { view, creationData } = me;\n\n // Remove terminals from source and target events.\n if (creationData) {\n const { source, sourceResource, target, targetResource } = creationData;\n\n if (source) {\n const el = view.getElementFromEventRecord(source, sourceResource);\n if (el) {\n me.hideTerminals(el);\n }\n }\n if (target) {\n const el = view.getElementFromEventRecord(target, targetResource);\n if (el) {\n me.hideTerminals(el);\n }\n }\n }\n\n me.creationData = null;\n\n me.mouseDetacher && me.mouseDetacher();\n\n me.removeConnector();\n }","_recoverySetup() {\n (async () => {\n await this._editorComplex.bodyClient.when_unrecoverableError();\n this._recoverIfPossible();\n })();\n }","_recoverySetup() {\n (async () => {\n await this._editorComplex.bodyClient.when_unrecoverableError();\n this._recoverIfPossible();\n })();\n }","async cleanup() {\n\n }","clearErr() {\n this.props.dispatch(clearWorkspaceErr());\n }","deleteAccount({ commit , dispatch}){\n const accessToken = localStorage.getItem(\"token\");\n axios.defaults.headers.common['Authorization'] = \"Bearer \" + accessToken;\n axios.delete(baseUrl + \"user\")\n .then(() => { \n dispatch(\"logout\")\n })\n .catch(errorObj => { \n const ar = [];\n ar.push(errorObj.response.data.error)\n for (let key in errorObj.response.data.extra) {\n for (let i = 0; i < errorObj.response.data.extra[key].length; i++)\n ar.push(errorObj.response.data.extra[key][i]);\n }\n commit(\"updateErrors\", ar);\n commit(\"updateSuccess\", []);\n })\n}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$3(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureCommitPhaseError(current,unmountError);}}}","function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$3(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureCommitPhaseError(current,unmountError);}}}","onDetectError() {\n\t\tthis.removeEventListeners();\n\t\tthis.onError();\n\t}","__checkDisposed() {\n if (this.__disposed) {\n throw new Error(\"Already disposed\");\n }\n }"],"string":"[\n \"detach() {\\n throw new Error('Not Implemented');\\n }\",\n \"detach() {\\n throw new Error('Not Implemented');\\n }\",\n \"function deleteErrHandler(error, result) {\\n\\tif (error) {\\n\\t\\tlog(\\\"cannot delete data\\\")\\n\\t\\tthrow error\\n\\t} else {\\n\\t\\tlog(\\\"Delete Success\\\") \\n\\t}\\n}\",\n \"componentWillUnmount() {\\n window.removeEventListener(\\\"unhandledrejection\\\", this.handleAllUncaughtErrors)\\n }\",\n \"function destroyed() {\\n throw new Error('Call made to destroyed method');\\n}\",\n \"disconnected() {\\n this.unsubscribe?.();\\n delete this.unsubscribe;\\n delete this.baseObject;\\n delete this.property;\\n delete this.replica;\\n delete this.path;\\n }\",\n \"function _handleRemove() {\\n Promise.all(deletePromises).catch(error => console.log(error));\\n next(err);\\n }\",\n \"function somethingBad() {\\n nock.cleanAll()\\n }\",\n \"function deleteMovieError() {\\n console.log('Unble to delete movie...');\\n}\",\n \"async cleanup() {\\n // The cleanup logic is as follows:\\n // - We first try to delete the resource using the delete() method\\n // - However, it is possible that the user that created the resource does not have permission\\n // to delete the resource or the user might have become inactive. Because of this we will\\n // also try to perform the same delete() method but with default admin credentials\\n\\n try {\\n await this.delete();\\n } catch (error) {\\n // Now we try with default admin credentials\\n const adminSession = await this.setup.defaultAdminSession();\\n this.axiosClient = adminSession.axiosClient;\\n await this.delete();\\n }\\n }\",\n \"detach() {\\n throw new Error('incompatible reuse strategy');\\n }\",\n \"function socketError() {\\n this.destroy();\\n}\",\n \"function socketError () {\\n this.destroy();\\n}\",\n \"function socketError () {\\n this.destroy();\\n}\",\n \"handleFailure (error_)\\n\\t{\\n\\t\\t// todo: Undo all actions\\n\\t\\tthis.cleanup ();\\n\\t\\tthrow error_;\\n\\t}\",\n \"function onerror(err){\\n debug('subscription \\\"%s\\\" error %s in pending state', sub.id, err.stack);\\n sub.destroy();\\n }\",\n \"componentWillUnmount() {\\n if (this.props.error) {\\n this.props.removeError();\\n }\\n }\",\n \"function socketOnError() {\\n this.destroy();\\n}\",\n \"function socketOnError() {\\n this.destroy();\\n}\",\n \"function socketOnError() {\\n this.destroy();\\n}\",\n \"cleanUpDeadCreeps () {\\n }\",\n \"async abort() {\\n return;\\n }\",\n \"function socketOnError () {\\n this.destroy();\\n}\",\n \"function socketOnError () {\\n this.destroy();\\n}\",\n \"function socketOnError () {\\n this.destroy();\\n}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current,unmountError);}}}\",\n \"onFail_() {\\n this.canAccess = false;\\n }\",\n \"static actualize() {\\n for (let i = 0; i < refs.length ; ++i) {\\n const ref = refs[i];\\n if (ref.isOutdated()) {\\n ref.remove();\\n refs.splice(i--, 1);\\n }\\n }\\n }\",\n \"function socketError () {\\n\\t this.destroy();\\n\\t}\",\n \"function socketError () {\\n\\t this.destroy();\\n\\t}\",\n \"function onFileSystemFail(err) {\\n console.log('deleteFileFromPersistentStorage file system fail: ' + fileName);\\n console.log('error code = ' + err.code);\\n }\",\n \"remove () {\\n // cleanup\\n }\",\n \"function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current$$1,instance){{invokeGuardedCallback(null,callComponentWillUnmountWithTimer,null,current$$1,instance);if(hasCaughtError()){var unmountError=clearCaughtError();captureCommitPhaseError(current$$1,unmountError);}}}\",\n \"function esconderError() {\\n setError(null);\\n }\",\n \"destroy (err) {\\n this._destroy(err, () => {})\\n }\",\n \"destroy (err) {\\n this._destroy(err, () => {})\\n }\",\n \"destroy (err) {\\n this._destroy(err, () => {})\\n }\",\n \"destroy (err) {\\n this._destroy(err, () => {})\\n }\",\n \"destroy (err) {\\n this._destroy(err, () => {})\\n }\",\n \"destroy (err) {\\n this._destroy(err, () => {})\\n }\",\n \"function deleteAircraftFailed(err) {\\n vm.showDeleteButton = true;\\n vm.showUpdateButton = true;\\n vm.message = LOGBOOK_CONSTANT.MSG_AIRCRAFT_DELETE_ERROR;\\n vm.working = false;\\n }\",\n \"function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)errorOrDestroy(dest,er);}// Make sure our error handler is attached before userland ones.\",\n \"function failed(e) {\\n console.error(e);\\n Notification.remove(note_id);\\n page(\\\"/error\\\");\\n note_id = null;\\n }\",\n \"onActivationError() {\\n this.removeListeners();\\n this.state = State.ERROR;\\n this.dispatchEvent(new GoogEvent(EventType.EXECUTED));\\n }\",\n \"function captureError(failedWork, error) {\\n // It is no longer valid because we exited the user code.\\n ReactCurrentOwner$2.current = null;\\n var boundary = null, errorBoundaryFound = !1, willRetry = !1, errorBoundaryName = null;\\n // Host containers are a special case. If the failed work itself is a host\\n // container, then it acts as its own boundary. In all other cases, we\\n // ignore the work itself and only search through the parents.\\n if (failedWork.tag === HostRoot$3) boundary = failedWork, isFailedBoundary(failedWork) && (// If this root already failed, there must have been an error when\\n // attempting to unmount it. This is a worst-case scenario and\\n // should only be possible if there's a bug in the renderer.\\n didFatal = !0); else for (var node = failedWork.return; null !== node && null === boundary; ) {\\n if (node.tag === ClassComponent$3) {\\n var instance = node.stateNode;\\n \\\"function\\\" == typeof instance.componentDidCatch && (errorBoundaryFound = !0, errorBoundaryName = getComponentName_1(node), \\n // Found an error boundary!\\n boundary = node, willRetry = !0);\\n } else node.tag === HostRoot$3 && (// Treat the root like a no-op error boundary\\n boundary = node);\\n if (isFailedBoundary(node)) {\\n // This boundary is already in a failed state.\\n // If we're currently unmounting, that means this error was\\n // thrown while unmounting a failed subtree. We should ignore\\n // the error.\\n if (isUnmounting) return null;\\n // If we're in the commit phase, we should check to see if\\n // this boundary already captured an error during this commit.\\n // This case exists because multiple errors can be thrown during\\n // a single commit without interruption.\\n if (null !== commitPhaseBoundaries && (commitPhaseBoundaries.has(node) || null !== node.alternate && commitPhaseBoundaries.has(node.alternate))) // If so, we should ignore this error.\\n return null;\\n // The error should propagate to the next boundary -— we keep looking.\\n boundary = null, willRetry = !1;\\n }\\n node = node.return;\\n }\\n if (null !== boundary) {\\n // Add to the collection of failed boundaries. This lets us know that\\n // subsequent errors in this subtree should propagate to the next boundary.\\n null === failedBoundaries && (failedBoundaries = new Set()), failedBoundaries.add(boundary);\\n // This method is unsafe outside of the begin and complete phases.\\n // We might be in the commit phase when an error is captured.\\n // The risk is that the return path from this Fiber may not be accurate.\\n // That risk is acceptable given the benefit of providing users more context.\\n var _componentStack = getStackAddendumByWorkInProgressFiber(failedWork), _componentName = getComponentName_1(failedWork);\\n // Add to the collection of captured errors. This is stored as a global\\n // map of errors and their component stack location keyed by the boundaries\\n // that capture them. We mostly use this Map as a Set; it's a Map only to\\n // avoid adding a field to Fiber to store the error.\\n null === capturedErrors && (capturedErrors = new Map());\\n var capturedError = {\\n componentName: _componentName,\\n componentStack: _componentStack,\\n error: error,\\n errorBoundary: errorBoundaryFound ? boundary.stateNode : null,\\n errorBoundaryFound: errorBoundaryFound,\\n errorBoundaryName: errorBoundaryName,\\n willRetry: willRetry\\n };\\n capturedErrors.set(boundary, capturedError);\\n try {\\n logCapturedError(capturedError);\\n } catch (e) {\\n // Prevent cycle if logCapturedError() throws.\\n // A cycle may still occur if logCapturedError renders a component that throws.\\n console.error(e);\\n }\\n // If we're in the commit phase, defer scheduling an update on the\\n // boundary until after the commit is complete\\n // Otherwise, schedule an update now.\\n // TODO: Is this actually necessary during the render phase? Is it\\n // possible to unwind and continue rendering at the same priority,\\n // without corrupting internal state?\\n return isCommitting ? (null === commitPhaseBoundaries && (commitPhaseBoundaries = new Set()), \\n commitPhaseBoundaries.add(boundary)) : scheduleErrorRecovery(boundary), boundary;\\n }\\n // If no boundary is found, we'll need to throw the error\\n return null === firstUncaughtError && (firstUncaughtError = error), null;\\n }\",\n \"cleanup() {}\",\n \"cleanup() {}\",\n \"function onFatal(root){root.finishedWork=null;}\",\n \"function onFatal(root){root.finishedWork=null;}\",\n \"function onFatal(root){root.finishedWork=null;}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"function onFatal(root) {\\n root.finishedWork = null;\\n}\",\n \"rethrowNonDiagnosticError(error) {\\n if (!error.isDiagnostic) {\\n throw error;\\n }\\n }\",\n \"function throwPortalOutletAlreadyDisposedError() {\\n throw Error('This PortalOutlet has already been disposed');\\n}\",\n \"function deleteShelterError(error) {\\n vm.error = \\\"Could not delete shelter at this time. Please try again later.\\\";\\n scrollToError();\\n }\",\n \"abort() {\\n const me = this,\\n { view, creationData } = me;\\n\\n // Remove terminals from source and target events.\\n if (creationData) {\\n const { source, sourceResource, target, targetResource } = creationData;\\n\\n if (source) {\\n const el = view.getElementFromEventRecord(source, sourceResource);\\n if (el) {\\n me.hideTerminals(el);\\n }\\n }\\n if (target) {\\n const el = view.getElementFromEventRecord(target, targetResource);\\n if (el) {\\n me.hideTerminals(el);\\n }\\n }\\n }\\n\\n me.creationData = null;\\n\\n me.mouseDetacher && me.mouseDetacher();\\n\\n me.removeConnector();\\n }\",\n \"_recoverySetup() {\\n (async () => {\\n await this._editorComplex.bodyClient.when_unrecoverableError();\\n this._recoverIfPossible();\\n })();\\n }\",\n \"_recoverySetup() {\\n (async () => {\\n await this._editorComplex.bodyClient.when_unrecoverableError();\\n this._recoverIfPossible();\\n })();\\n }\",\n \"async cleanup() {\\n\\n }\",\n \"clearErr() {\\n this.props.dispatch(clearWorkspaceErr());\\n }\",\n \"deleteAccount({ commit , dispatch}){\\n const accessToken = localStorage.getItem(\\\"token\\\");\\n axios.defaults.headers.common['Authorization'] = \\\"Bearer \\\" + accessToken;\\n axios.delete(baseUrl + \\\"user\\\")\\n .then(() => { \\n dispatch(\\\"logout\\\")\\n })\\n .catch(errorObj => { \\n const ar = [];\\n ar.push(errorObj.response.data.error)\\n for (let key in errorObj.response.data.extra) {\\n for (let i = 0; i < errorObj.response.data.extra[key].length; i++)\\n ar.push(errorObj.response.data.extra[key][i]);\\n }\\n commit(\\\"updateErrors\\\", ar);\\n commit(\\\"updateSuccess\\\", []);\\n })\\n}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$3(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureCommitPhaseError(current,unmountError);}}}\",\n \"function safelyCallComponentWillUnmount(current,instance){{invokeGuardedCallback$3(null,callComponentWillUnmountWithTimer,null,current,instance);if(hasCaughtError$1()){var unmountError=clearCaughtError$1();captureCommitPhaseError(current,unmountError);}}}\",\n \"onDetectError() {\\n\\t\\tthis.removeEventListeners();\\n\\t\\tthis.onError();\\n\\t}\",\n \"__checkDisposed() {\\n if (this.__disposed) {\\n throw new Error(\\\"Already disposed\\\");\\n }\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60742086","0.60742086","0.59141797","0.59037095","0.58821017","0.58274007","0.58048403","0.5790703","0.57566315","0.57082933","0.56811607","0.5672898","0.56346536","0.56346536","0.5631592","0.5605371","0.55458134","0.55373806","0.55373806","0.55373806","0.5519651","0.5501088","0.5499455","0.5499455","0.5499455","0.5496596","0.5496596","0.5496596","0.5496596","0.5496596","0.54789186","0.54782945","0.54776114","0.54776114","0.5468973","0.5459643","0.5454014","0.5454014","0.5454014","0.54486823","0.544368","0.544368","0.544368","0.544368","0.544368","0.544368","0.5431967","0.5418852","0.5387412","0.53874046","0.5382237","0.5356721","0.5356721","0.5355735","0.5355735","0.5355735","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.53296226","0.5329503","0.5326705","0.53158313","0.5308731","0.5306378","0.5306378","0.52792174","0.5264077","0.5255767","0.5248388","0.5248388","0.52461153","0.5236144"],"string":"[\n \"0.60742086\",\n \"0.60742086\",\n \"0.59141797\",\n \"0.59037095\",\n \"0.58821017\",\n \"0.58274007\",\n \"0.58048403\",\n \"0.5790703\",\n \"0.57566315\",\n \"0.57082933\",\n \"0.56811607\",\n \"0.5672898\",\n \"0.56346536\",\n \"0.56346536\",\n \"0.5631592\",\n \"0.5605371\",\n \"0.55458134\",\n \"0.55373806\",\n \"0.55373806\",\n \"0.55373806\",\n \"0.5519651\",\n \"0.5501088\",\n \"0.5499455\",\n \"0.5499455\",\n \"0.5499455\",\n \"0.5496596\",\n \"0.5496596\",\n \"0.5496596\",\n \"0.5496596\",\n \"0.5496596\",\n \"0.54789186\",\n \"0.54782945\",\n \"0.54776114\",\n \"0.54776114\",\n \"0.5468973\",\n \"0.5459643\",\n \"0.5454014\",\n \"0.5454014\",\n \"0.5454014\",\n \"0.54486823\",\n \"0.544368\",\n \"0.544368\",\n \"0.544368\",\n \"0.544368\",\n \"0.544368\",\n \"0.544368\",\n \"0.5431967\",\n \"0.5418852\",\n \"0.5387412\",\n \"0.53874046\",\n \"0.5382237\",\n \"0.5356721\",\n \"0.5356721\",\n \"0.5355735\",\n \"0.5355735\",\n \"0.5355735\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.53296226\",\n \"0.5329503\",\n \"0.5326705\",\n \"0.53158313\",\n \"0.5308731\",\n \"0.5306378\",\n \"0.5306378\",\n \"0.52792174\",\n \"0.5264077\",\n \"0.5255767\",\n \"0.5248388\",\n \"0.5248388\",\n \"0.52461153\",\n \"0.5236144\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5789,"cells":{"query":{"kind":"string","value":"Creates a unique async expiration time."},"document":{"kind":"string","value":"function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result >= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration - 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n}","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function computeUniqueAsyncExpiration() {\n var currentTime = recalculateCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration is fired multiple times\n // within a 200ms window (or whatever the async bucket size is).\n result = lastUniqueAsyncExpiration + 1;\n }\n lastUniqueAsyncExpiration = result;\n return lastUniqueAsyncExpiration;\n }","function generateExpirationDate() {\n\tvar currentDate = new Date();\n\tcurrentDate = currentDate.setDate(currentDate.getDate() + 1);\n\treturn new Date(currentDate).toISOString();\n}","function _createExpiryValue(identifier, freshness) {\n\t\treturn identifier + \"|\" + (new Date().getTime()+freshness);\n\t}","function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}","function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}","function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}","function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}","function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}","function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}","function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}","function msToExpirationTime(ms){// Always subtract from the offset so that we don't clash with the magic number for NoWork.\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}","function msToExpirationTime(ms){// Always subtract from the offset so that we don't clash with the magic number for NoWork.\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}","function msToExpirationTime(ms){// Always subtract from the offset so that we don't clash with the magic number for NoWork.\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}","function _createExpiryKey(key) {\n\t\treturn key + \"_time\";\n\t}","function expireDate() {\n var date = new Date(Date.now());\n date.setUTCHours(date.getUTCHours() - SESSION_LENGTH);\n return date;\n}","expiryTime(now) {\n if (this.maxAge != null) {\n const relativeTo = now || this.creation || new Date();\n const age = this.maxAge <= 0 ? -Infinity : this.maxAge * 1000;\n return relativeTo.getTime() + age;\n }\n\n if (this.expires == Infinity) {\n return Infinity;\n }\n return this.expires.getTime();\n }","expiryTime(now) {\n if (this.maxAge != null) {\n const relativeTo = now || this.creation || new Date();\n const age = this.maxAge <= 0 ? -Infinity : this.maxAge * 1000;\n return relativeTo.getTime() + age;\n }\n\n if (this.expires == Infinity) {\n return Infinity;\n }\n return this.expires.getTime();\n }","static getNewExpireTime(newTime) {\n let now = new Date();\n let time = now.getTime();\n time += newTime;\n now.setTime(time);\n return now.toUTCString();\n }","function getExpirationInSeconds () {\n const nowInSeconds = Math.floor(Date.now() / 1000)\n\n return {\n iat: nowInSeconds,\n exp: nowInSeconds + 30\n }\n}","scheduleRenewal() {\n\n return new Promise((resolve, reject) => {\n\n const delay = AuthService.tokenExpiresAt - Date.now();\n if (delay > 0) {\n log.debug(`[AuthService] setting renewal ${Math.floor(delay / 60000)} minutes: ${new Date(AuthService.tokenExpiresAt)}`);\n tokenRenewalTimeout = setTimeout(() => {\n log.debug('[AuthService] attempting scheduled renewal');\n return this.renewToken()\n .then(() => {\n this.scheduleRenewal();\n return resolve();\n })\n .catch(reject);\n }, delay);\n }\n });\n }","getExpiration() {\n const expiration = localStorage.getItem(\"expires_at\");\n const expiresAt = JSON.parse(expiration);\n return moment(expiresAt);\n }","checkExpiration() {\n const interval = Number(this.options.refreshInterval);\n if (interval) {\n const time = getTime(-interval);\n this.invalidate(time);\n }\n }","function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\n\treturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n }","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n }","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n }","function msToExpirationTime(ms) {\n\t // Always add an offset so that we don't clash with the magic number for NoWork.\n\t return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n\t}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n }","function msToExpirationTime(ms) {\n // 加上偏移量以避免10ms以内的与NoWork冲突\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}","function msToExpirationTime(ms) {\n // Always add an offset so that we don't clash with the magic number for NoWork.\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\n}"],"string":"[\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = requestCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result >= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration - 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n}\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function computeUniqueAsyncExpiration() {\\n var currentTime = recalculateCurrentTime();\\n var result = computeAsyncExpiration(currentTime);\\n if (result <= lastUniqueAsyncExpiration) {\\n // Since we assume the current time monotonically increases, we only hit\\n // this branch when computeUniqueAsyncExpiration is fired multiple times\\n // within a 200ms window (or whatever the async bucket size is).\\n result = lastUniqueAsyncExpiration + 1;\\n }\\n lastUniqueAsyncExpiration = result;\\n return lastUniqueAsyncExpiration;\\n }\",\n \"function generateExpirationDate() {\\n\\tvar currentDate = new Date();\\n\\tcurrentDate = currentDate.setDate(currentDate.getDate() + 1);\\n\\treturn new Date(currentDate).toISOString();\\n}\",\n \"function _createExpiryValue(identifier, freshness) {\\n\\t\\treturn identifier + \\\"|\\\" + (new Date().getTime()+freshness);\\n\\t}\",\n \"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}\",\n \"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}\",\n \"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}\",\n \"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}\",\n \"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}\",\n \"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}\",\n \"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}\",\n \"function msToExpirationTime(ms){// Always subtract from the offset so that we don't clash with the magic number for NoWork.\\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}\",\n \"function msToExpirationTime(ms){// Always subtract from the offset so that we don't clash with the magic number for NoWork.\\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}\",\n \"function msToExpirationTime(ms){// Always subtract from the offset so that we don't clash with the magic number for NoWork.\\nreturn MAGIC_NUMBER_OFFSET-(ms/UNIT_SIZE|0);}\",\n \"function _createExpiryKey(key) {\\n\\t\\treturn key + \\\"_time\\\";\\n\\t}\",\n \"function expireDate() {\\n var date = new Date(Date.now());\\n date.setUTCHours(date.getUTCHours() - SESSION_LENGTH);\\n return date;\\n}\",\n \"expiryTime(now) {\\n if (this.maxAge != null) {\\n const relativeTo = now || this.creation || new Date();\\n const age = this.maxAge <= 0 ? -Infinity : this.maxAge * 1000;\\n return relativeTo.getTime() + age;\\n }\\n\\n if (this.expires == Infinity) {\\n return Infinity;\\n }\\n return this.expires.getTime();\\n }\",\n \"expiryTime(now) {\\n if (this.maxAge != null) {\\n const relativeTo = now || this.creation || new Date();\\n const age = this.maxAge <= 0 ? -Infinity : this.maxAge * 1000;\\n return relativeTo.getTime() + age;\\n }\\n\\n if (this.expires == Infinity) {\\n return Infinity;\\n }\\n return this.expires.getTime();\\n }\",\n \"static getNewExpireTime(newTime) {\\n let now = new Date();\\n let time = now.getTime();\\n time += newTime;\\n now.setTime(time);\\n return now.toUTCString();\\n }\",\n \"function getExpirationInSeconds () {\\n const nowInSeconds = Math.floor(Date.now() / 1000)\\n\\n return {\\n iat: nowInSeconds,\\n exp: nowInSeconds + 30\\n }\\n}\",\n \"scheduleRenewal() {\\n\\n return new Promise((resolve, reject) => {\\n\\n const delay = AuthService.tokenExpiresAt - Date.now();\\n if (delay > 0) {\\n log.debug(`[AuthService] setting renewal ${Math.floor(delay / 60000)} minutes: ${new Date(AuthService.tokenExpiresAt)}`);\\n tokenRenewalTimeout = setTimeout(() => {\\n log.debug('[AuthService] attempting scheduled renewal');\\n return this.renewToken()\\n .then(() => {\\n this.scheduleRenewal();\\n return resolve();\\n })\\n .catch(reject);\\n }, delay);\\n }\\n });\\n }\",\n \"getExpiration() {\\n const expiration = localStorage.getItem(\\\"expires_at\\\");\\n const expiresAt = JSON.parse(expiration);\\n return moment(expiresAt);\\n }\",\n \"checkExpiration() {\\n const interval = Number(this.options.refreshInterval);\\n if (interval) {\\n const time = getTime(-interval);\\n this.invalidate(time);\\n }\\n }\",\n \"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\\n\\treturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n }\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n }\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n }\",\n \"function msToExpirationTime(ms) {\\n\\t // Always add an offset so that we don't clash with the magic number for NoWork.\\n\\t return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n\\t}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n }\",\n \"function msToExpirationTime(ms) {\\n // 加上偏移量以避免10ms以内的与NoWork冲突\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\",\n \"function msToExpirationTime(ms) {\\n // Always add an offset so that we don't clash with the magic number for NoWork.\\n return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.680362","0.680362","0.680362","0.680362","0.680362","0.680362","0.680362","0.680362","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67935026","0.67899007","0.677218","0.6756696","0.6756696","0.6756696","0.6756696","0.6756696","0.6756696","0.6756696","0.6756696","0.6756696","0.6756696","0.6756696","0.6756696","0.62128294","0.6055528","0.5950529","0.5950529","0.5950529","0.5908187","0.5908187","0.5908187","0.5908187","0.58501506","0.58501506","0.58501506","0.5840834","0.5829148","0.5802407","0.5802407","0.57852596","0.5737069","0.57045305","0.5700234","0.5641491","0.5633922","0.5630234","0.5630234","0.5630234","0.56073004","0.5583723","0.5580839","0.5562417","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053","0.55587053"],"string":"[\n \"0.680362\",\n \"0.680362\",\n \"0.680362\",\n \"0.680362\",\n \"0.680362\",\n \"0.680362\",\n \"0.680362\",\n \"0.680362\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67935026\",\n \"0.67899007\",\n \"0.677218\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.6756696\",\n \"0.62128294\",\n \"0.6055528\",\n \"0.5950529\",\n \"0.5950529\",\n \"0.5950529\",\n \"0.5908187\",\n \"0.5908187\",\n \"0.5908187\",\n \"0.5908187\",\n \"0.58501506\",\n \"0.58501506\",\n \"0.58501506\",\n \"0.5840834\",\n \"0.5829148\",\n \"0.5802407\",\n \"0.5802407\",\n \"0.57852596\",\n \"0.5737069\",\n \"0.57045305\",\n \"0.5700234\",\n \"0.5641491\",\n \"0.5633922\",\n \"0.5630234\",\n \"0.5630234\",\n \"0.5630234\",\n \"0.56073004\",\n \"0.5583723\",\n \"0.5580839\",\n \"0.5562417\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\",\n \"0.55587053\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6765476"},"document_rank":{"kind":"string","value":"42"}}},{"rowIdx":5790,"cells":{"query":{"kind":"string","value":"TODO: Rename this to scheduleTimeout or something"},"document":{"kind":"string","value":"function suspendRoot(root, thenable, timeoutMs, suspendedTime) {\n // Schedule the timeout.\n if (timeoutMs >= 0 && nextLatestTimeoutMs < timeoutMs) {\n nextLatestTimeoutMs = timeoutMs;\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["schedule(delay = this.timeout) {\r\n this.cancel();\r\n this.timeoutToken = setTimeout(this.timeoutHandler, delay);\r\n }","function setupTimeoutTimer() {\n updateTimeoutInfo(undefined);\n }","onTimeout() {}","async setTimeout() {\n const TimeoutRequestsWindowTime = 5*60*1000;\n let timeElapse = await (new Date().getTime().toString().slice(0,-3)) - this.requestTimeStamp;\n let timeLeft = await (TimeoutRequestsWindowTime/1000) - timeElapse;\n this.validationWindow = await timeLeft;\n }","function reload_timeout_trigger(){\n \n}","ontimeout() {}","function updateTimeout() {\n\ttimeout /= 1.043;\n}","function setCustomTimeout(fn, delay){\n //wait\n var cur_d = new Date();\n var cur_ticks = cur_d.getTime();\n var ms_passed = 0;\n while(ms_passed < delay) {\n var d = new Date(); // Possible memory leak?\n var ticks = d.getTime();\n ms_passed = ticks - cur_ticks;\n d = null; // Prevent memory leak?\n }\n fn(); // PLAIN CALL\n}","function schedulePeriodicTest()\n{\n\tthis.CallbackTimer = setTimeout(periodic_test.bind(this), 10000);\n}","function startTimeout(fail) {\r\n\t\ttimeout = setTimeout(function () {\r\n\t\t\tfail();\r\n\t\t}, 5000);\r\n\t}","function timeoutFunction() {\n\t\t\tif (timeouts.length) {\n\t\t\t\t(timeouts.shift())();\n\t\t\t}\n\t\t}","function timeoutFunction() {\n\t\t\tif (timeouts.length) {\n\t\t\t\t(timeouts.shift())();\n\t\t\t}\n\t\t}","_restartPublishTimer() {\n if(this.publishEnabled) {\n this.timeoutId = setTimeout(() => this._publish(), this.publishRateMs);\n }\n }","function scheduleNextExecution () {\n\t\tif ( status == \"running\" ) {\n\t\t\ttimerId = setTimeout( runAndScheduleTask, interval );\n\t\t}\n\t}","timeout(ms) {\n let d = new Date();\n let init = d.getTime();\n\n let currD = 0;\n\n while( currD < init + ms) {\n let d2 = new Date();\n currD = d2.getTime();\n }\n }","setTimeout(ms) {\n if (!this._commandTimeoutTimer) {\n this._commandTimeoutTimer = setTimeout(() => {\n if (!this.isResolved) {\n this.reject(new Error(\"Command timed out\"));\n }\n }, ms);\n }\n }","commandTimeout() {\n // if there are commands in the queue - pop the earliest command from the queue as a timeout\n if (this.command_stack.length > 0) {\n let last_command = this.command_stack.shift();\n this.log(`command ${last_command.command} timed out`);\n last_command.response_at = new Date();\n this.emit('timeout', last_command);\n this.lock = false;\n setTimeout(this.processCommand.bind(this), this.next_command_delay);\n }\n }","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n }","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n }","function handleTimeout() {\n console.log(\"Timeout\");\n }","function SetDelay() {\r\n setTimeout(function(){CreateBadgeReqLinks();},3000); //3 seconds\r\n console.log(\"setting timout\");\r\n }","function o(){throw new Error(\"setTimeout has not been defined\")}","function actually_setTimeout() {\n data.id = setTimeout( function(){ data.fn(); }, delay );\n }","function scheduleRefresh() {\n\tif (refreshEvent) {\n\t\tclearTimeout(refreshEvent);\n\t}\n\trefreshEvent = setTimeout(function() {refresh(); refreshEvent = null;}, refreshDelay);\n}","function schedule(elapsed) {\n\t self.state = SCHEDULED;\n\t if (self.delay <= elapsed) start(elapsed - self.delay);\n\t else self.timer.restart(start, self.delay, self.time);\n\t }","function schedule(elapsed) {\n\t self.state = SCHEDULED;\n\t if (self.delay <= elapsed) start(elapsed - self.delay);\n\t else self.timer.restart(start, self.delay, self.time);\n\t }","function schedule(elapsed) {\n\t self.state = SCHEDULED;\n\t if (self.delay <= elapsed) start(elapsed - self.delay);\n\t else self.timer.restart(start, self.delay, self.time);\n\t }","function doTimer()\n{\n setTimeout(setSubmitmsg(),60000);\n \n}","function schedule(elapsed) {\n self.state = SCHEDULED;\n if (self.delay <= elapsed) start(elapsed - self.delay);\n else self.timer.restart(start, self.delay, self.time);\n }","isScheduled() {\r\n return this.timeoutToken !== -1;\r\n }","setStartupTimer() {\n let self = this;\n //+ coerces the result to a number, making typescript happy.\n this.startupTimer = +setTimeout(() => {\n self.emit(\"timeout\");\n }, STARTUP_TIMEOUT_DURATION);\n }","function scheduleReminderForUser() {\n reminderTimeoutId = setTimeout(remindUser, Math.max((lastSurveyRequest + reminderInterval * millisecondsPerSecond) - Date.now(), 0));\n}","_registerRefreshTokenTimeout() {\n\t\tconst tokenRefreshTimeoutTime = this._getTokenRefreshTimeoutTime();\n\n\t\tclearTimeout( this._tokenRefreshTimeout );\n\n\t\tthis._tokenRefreshTimeout = setTimeout( () => {\n\t\t\tthis.refreshToken();\n\t\t}, tokenRefreshTimeoutTime );\n\t}","function clearExistingTimeout() {\n if ( timeoutID ) {\n clearTimeout( timeoutID );\n }\n } // Function to cancel next exec","function defaultSetTimout() {\n\t throw new Error('setTimeout has not been defined');\n\t}","function defaultSetTimout() {\n\t throw new Error('setTimeout has not been defined');\n\t}","function defaultSetTimout() {\n\t throw new Error('setTimeout has not been defined');\n\t}","function defaultSetTimout() {\n\t throw new Error('setTimeout has not been defined');\n\t}","function defaultSetTimout() {\n\t throw new Error('setTimeout has not been defined');\n\t}","function defaultSetTimout() {\n\t throw new Error('setTimeout has not been defined');\n\t}","function defaultSetTimout() {\n\t throw new Error('setTimeout has not been defined');\n\t}","function defaultSetTimout() {\n\t throw new Error('setTimeout has not been defined');\n\t}","scheduleRefresh() {}","scheduleRefresh() {}","_scheduleSendResponseMessage() {\n\n }","function schedule () {\n var future = next()\n var delta = Math.max(future.diff(moment()), 1000)\n\n debug(name + ': next run in ' + ms(delta) +\n ' at ' + future.format('llll Z'))\n\n if (timer) clearTimeout(timer)\n timer = setTimeout(run, delta)\n }","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n }","function updateTimeout()\n {\n clearTimeout(timeout);\n timeout = setTimeout(function()\n {\n self.refresh();\n// }, 30*1000)\n }, 60 * 60 * 1000);\n }","constructor(timeout) {\n this.initialTimeout = timeout\n this.reset()\n }","function clearExistingTimeout() {\n if (timeoutID) {\n clearTimeout(timeoutID);\n }\n } // Function to cancel next exec","constructor(timeout_in_secs) {\n this.initial_timeout_in_secs = timeout_in_secs\n this.reset()\n }","_resumeTimeout() {\n\t\tif (this._delayTime > 0) {\n\t\t\tthis._startDelayTime = new Date();\n\t\t\tthis._timer = setTimeout(() => {\n\t\t\t\tthis.close();\n\t\t\t}, this._delayTime);\n\t\t}\n\t}","function stopSchedule() {\n window.clearTimeout(wrt.scheduleTimeout);\n window.clearTimeout(wrt.updateTimeout);\n setUpdateMessage('');\n wrt.isScheduled = false;\n }","function clearExistingTimeout() {\n\t if (timeoutID) {\n\t clearTimeout(timeoutID);\n\t }\n\t } // Function to cancel next exec","function clearExistingTimeout() {\n\t if (timeoutID) {\n\t clearTimeout(timeoutID);\n\t }\n\t } // Function to cancel next exec","function setTimeoutForEvents() {\n\t\tfor(var channel in events) {\n\t\t\tif(carsts[channel]) {\n\t\t\t\tevents[channel].forEach(function (event) {\n\t\t\t\t\tsetTimeoutForEvent(event);\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\tsetTimeout(setTimeoutForEvents, 86400000);\n\t}","function timeoutShim(callback) {\n window.setTimeout(callback, 1000/(storm.animationInterval || 20));\n }","UnscheduleAt(time){\n \tconsole.log(\"unschedule\");\n }","function I(){return a.setTimeout(function(){eb=void 0}),eb=fa.now()}","function setTimeout(callback, timeout) {return callback()} // TODO","function clearExistingTimeout() {\n if (timeoutID) {\n clearTimeout(timeoutID);\n }\n } // Function to cancel next exec","function clearExistingTimeout() {\n if (timeoutID) {\n clearTimeout(timeoutID);\n }\n } // Function to cancel next exec","function clearExistingTimeout() {\n if (timeoutID) {\n clearTimeout(timeoutID);\n }\n } // Function to cancel next exec","function clearExistingTimeout() {\n if (timeoutID) {\n clearTimeout(timeoutID);\n }\n } // Function to cancel next exec","function clearExistingTimeout() {\n if (timeoutID) {\n clearTimeout(timeoutID);\n }\n } // Function to cancel next exec","function clearExistingTimeout() {\n if (timeoutID) {\n clearTimeout(timeoutID);\n }\n } // Function to cancel next exec","function clearExistingTimeout() {\n if (timeoutID) {\n clearTimeout(timeoutID);\n }\n } // Function to cancel next exec","function schedule() {\n var now = new Date().getTime(), delta = now - lastCycleTime, timeout = (30 * 60 * 1000) - delta, then = new Date(now + timeout);\n if (timeout < 100) timeout = 100;\n setTimeout(start, timeout);\n console.log(\"\\nNext cycle time:\", then.toLocaleString());\n}","function tweakWaitTime(t) {\n t += (t*Math.random()/5*(Math.random()>.5 ? 1 : -1));\n // now we need to tweak the start time to avoid a timing problem in htmlservice \n // .. never start one within 750ms of the last one.\n var now = new Date().getTime();\n startTime_ = Math.max(now + t, startTime_+750);\n return startTime_ - now;\n }","function executeAfterTime(name, time, randomTimeLimit){\n setInterval(function () {\n sendAfterTime(name, 3000);\n }, time, randomTimeLimit);\n}","function setTime(time) {\n timeout = time;\n}","createMaxWaitTimer(waitTime) {\n this.cancelMaxWaitTimer();\n \n this.retryMaxTimer = this.service.$setTimer(() => {\n let continueRetry;\n if (this.retryMaxTimeCallback && typeof (this.retryMaxTimeCallback) === \"function\") {\n let result = this.retryMaxTimeCallback();\n continueRetry = result && result === true;\n }\n \n if (!continueRetry) {\n this.cancel('Max time reached');\n this.service.logMessage(`Max wait time reached caller opted to cancel retry. Operation ${this.name} cancelled.`);\n } else {\n this.service.logMessage(`Max wait time reached caller opted to continue retry. Operation ${this.name} continuing`);\n }\n }, waitTime);\n }","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","static timeout(ms) {\n const signal = new AbortSignal();\n const timer = setTimeout(abortSignal, ms, signal);\n // Prevent the active Timer from keeping the Node.js event loop active.\n if (typeof timer.unref === \"function\") {\n timer.unref();\n }\n return signal;\n }","static timeout(ms) {\n const signal = new AbortSignal();\n const timer = setTimeout(abortSignal, ms, signal);\n // Prevent the active Timer from keeping the Node.js event loop active.\n if (typeof timer.unref === \"function\") {\n timer.unref();\n }\n return signal;\n }","static timeout(ms) {\n const signal = new AbortSignal();\n const timer = setTimeout(abortSignal, ms, signal);\n // Prevent the active Timer from keeping the Node.js event loop active.\n if (typeof timer.unref === \"function\") {\n timer.unref();\n }\n return signal;\n }","eventTimer() {throw new Error('Must declare the function')}","function _on_timeout(){\n\t anchor.finish_wait();\n\t}","function delayed() {\n // if we're executing at the end of the detection period\n if (!execAsap)\n func.apply(obj, args); // execute now\n // clear timeout handle\n timeout = null;\n }","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","function defaultSetTimout() {\n throw new Error('setTimeout has not been defined');\n}","scheduleWatchMessages() {\n this.cronJob = schedule(checkFrequency, this.checkNewMessages.bind(this), {});\n }","setTimeout(callback, delay){\n\t\tthis.game.time.events.add(delay, (function(){callback()}), this.game)\n\t}","function updateTimeouts() {\n const timeouts = getSortedTimeouts();\n if (timeouts.length == 0) {\n printTimeouts(discordClient, timeoutChannelId);\n return;\n }\n let i = 0;\n // Mitigate a race condition with the cron job. The cron job throws an error\n // if the wake time is in the past, so remove people one minute early and hope\n // the cron gets started before the next closest time passes.\n const now = util.addMinutes(new Date(), 1);\n while (i < timeouts.length && timeouts[i].timeout < now) {\n removeUser(timeouts[i]);\n i++;\n }\n\n if (i < timeouts.length) {\n setCronTimeout(timeouts[i].timeout);\n } else {\n console.log('No more timeouts, not starting cron job');\n }\n\n printTimeouts(discordClient, timeoutChannelId);\n}","function callbackWrapper() {\n var diff = startTime + timeout - Date.now();\n\n if (diff > 0) {\n var newTimeout = self.cronTime.getTimeout();\n\n if (newTimeout > diff) {\n newTimeout = diff;\n }\n\n remaining += newTimeout;\n } // If there is sleep time remaining, calculate how long and go to sleep\n // again. This processing might make us miss the deadline by a few ms\n // times the number of sleep sessions. Given a MAXDELAY of almost a\n // month, this should be no issue.\n\n\n self.lastExecution = new Date();\n\n if (remaining) {\n if (remaining > MAXDELAY) {\n remaining -= MAXDELAY;\n timeout = MAXDELAY;\n } else {\n timeout = remaining;\n remaining = 0;\n }\n\n _setTimeout(timeout);\n } else {\n // We have arrived at the correct point in time.\n self.running = false; // start before calling back so the callbacks have the ability to stop the cron job\n\n if (!self.runOnce) self.start();\n self.fireOnTick();\n }\n }","function accuse_timeout(player_name, index) {\n players[index].claim_timeout();\n}","static timeout(t) {\n if ( !(typeof t === 'undefined' ))\n _timeout = t;\n else\n return _timeout;\n }"],"string":"[\n \"schedule(delay = this.timeout) {\\r\\n this.cancel();\\r\\n this.timeoutToken = setTimeout(this.timeoutHandler, delay);\\r\\n }\",\n \"function setupTimeoutTimer() {\\n updateTimeoutInfo(undefined);\\n }\",\n \"onTimeout() {}\",\n \"async setTimeout() {\\n const TimeoutRequestsWindowTime = 5*60*1000;\\n let timeElapse = await (new Date().getTime().toString().slice(0,-3)) - this.requestTimeStamp;\\n let timeLeft = await (TimeoutRequestsWindowTime/1000) - timeElapse;\\n this.validationWindow = await timeLeft;\\n }\",\n \"function reload_timeout_trigger(){\\n \\n}\",\n \"ontimeout() {}\",\n \"function updateTimeout() {\\n\\ttimeout /= 1.043;\\n}\",\n \"function setCustomTimeout(fn, delay){\\n //wait\\n var cur_d = new Date();\\n var cur_ticks = cur_d.getTime();\\n var ms_passed = 0;\\n while(ms_passed < delay) {\\n var d = new Date(); // Possible memory leak?\\n var ticks = d.getTime();\\n ms_passed = ticks - cur_ticks;\\n d = null; // Prevent memory leak?\\n }\\n fn(); // PLAIN CALL\\n}\",\n \"function schedulePeriodicTest()\\n{\\n\\tthis.CallbackTimer = setTimeout(periodic_test.bind(this), 10000);\\n}\",\n \"function startTimeout(fail) {\\r\\n\\t\\ttimeout = setTimeout(function () {\\r\\n\\t\\t\\tfail();\\r\\n\\t\\t}, 5000);\\r\\n\\t}\",\n \"function timeoutFunction() {\\n\\t\\t\\tif (timeouts.length) {\\n\\t\\t\\t\\t(timeouts.shift())();\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function timeoutFunction() {\\n\\t\\t\\tif (timeouts.length) {\\n\\t\\t\\t\\t(timeouts.shift())();\\n\\t\\t\\t}\\n\\t\\t}\",\n \"_restartPublishTimer() {\\n if(this.publishEnabled) {\\n this.timeoutId = setTimeout(() => this._publish(), this.publishRateMs);\\n }\\n }\",\n \"function scheduleNextExecution () {\\n\\t\\tif ( status == \\\"running\\\" ) {\\n\\t\\t\\ttimerId = setTimeout( runAndScheduleTask, interval );\\n\\t\\t}\\n\\t}\",\n \"timeout(ms) {\\n let d = new Date();\\n let init = d.getTime();\\n\\n let currD = 0;\\n\\n while( currD < init + ms) {\\n let d2 = new Date();\\n currD = d2.getTime();\\n }\\n }\",\n \"setTimeout(ms) {\\n if (!this._commandTimeoutTimer) {\\n this._commandTimeoutTimer = setTimeout(() => {\\n if (!this.isResolved) {\\n this.reject(new Error(\\\"Command timed out\\\"));\\n }\\n }, ms);\\n }\\n }\",\n \"commandTimeout() {\\n // if there are commands in the queue - pop the earliest command from the queue as a timeout\\n if (this.command_stack.length > 0) {\\n let last_command = this.command_stack.shift();\\n this.log(`command ${last_command.command} timed out`);\\n last_command.response_at = new Date();\\n this.emit('timeout', last_command);\\n this.lock = false;\\n setTimeout(this.processCommand.bind(this), this.next_command_delay);\\n }\\n }\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n }\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n }\",\n \"function handleTimeout() {\\n console.log(\\\"Timeout\\\");\\n }\",\n \"function SetDelay() {\\r\\n setTimeout(function(){CreateBadgeReqLinks();},3000); //3 seconds\\r\\n console.log(\\\"setting timout\\\");\\r\\n }\",\n \"function o(){throw new Error(\\\"setTimeout has not been defined\\\")}\",\n \"function actually_setTimeout() {\\n data.id = setTimeout( function(){ data.fn(); }, delay );\\n }\",\n \"function scheduleRefresh() {\\n\\tif (refreshEvent) {\\n\\t\\tclearTimeout(refreshEvent);\\n\\t}\\n\\trefreshEvent = setTimeout(function() {refresh(); refreshEvent = null;}, refreshDelay);\\n}\",\n \"function schedule(elapsed) {\\n\\t self.state = SCHEDULED;\\n\\t if (self.delay <= elapsed) start(elapsed - self.delay);\\n\\t else self.timer.restart(start, self.delay, self.time);\\n\\t }\",\n \"function schedule(elapsed) {\\n\\t self.state = SCHEDULED;\\n\\t if (self.delay <= elapsed) start(elapsed - self.delay);\\n\\t else self.timer.restart(start, self.delay, self.time);\\n\\t }\",\n \"function schedule(elapsed) {\\n\\t self.state = SCHEDULED;\\n\\t if (self.delay <= elapsed) start(elapsed - self.delay);\\n\\t else self.timer.restart(start, self.delay, self.time);\\n\\t }\",\n \"function doTimer()\\n{\\n setTimeout(setSubmitmsg(),60000);\\n \\n}\",\n \"function schedule(elapsed) {\\n self.state = SCHEDULED;\\n if (self.delay <= elapsed) start(elapsed - self.delay);\\n else self.timer.restart(start, self.delay, self.time);\\n }\",\n \"isScheduled() {\\r\\n return this.timeoutToken !== -1;\\r\\n }\",\n \"setStartupTimer() {\\n let self = this;\\n //+ coerces the result to a number, making typescript happy.\\n this.startupTimer = +setTimeout(() => {\\n self.emit(\\\"timeout\\\");\\n }, STARTUP_TIMEOUT_DURATION);\\n }\",\n \"function scheduleReminderForUser() {\\n reminderTimeoutId = setTimeout(remindUser, Math.max((lastSurveyRequest + reminderInterval * millisecondsPerSecond) - Date.now(), 0));\\n}\",\n \"_registerRefreshTokenTimeout() {\\n\\t\\tconst tokenRefreshTimeoutTime = this._getTokenRefreshTimeoutTime();\\n\\n\\t\\tclearTimeout( this._tokenRefreshTimeout );\\n\\n\\t\\tthis._tokenRefreshTimeout = setTimeout( () => {\\n\\t\\t\\tthis.refreshToken();\\n\\t\\t}, tokenRefreshTimeoutTime );\\n\\t}\",\n \"function clearExistingTimeout() {\\n if ( timeoutID ) {\\n clearTimeout( timeoutID );\\n }\\n } // Function to cancel next exec\",\n \"function defaultSetTimout() {\\n\\t throw new Error('setTimeout has not been defined');\\n\\t}\",\n \"function defaultSetTimout() {\\n\\t throw new Error('setTimeout has not been defined');\\n\\t}\",\n \"function defaultSetTimout() {\\n\\t throw new Error('setTimeout has not been defined');\\n\\t}\",\n \"function defaultSetTimout() {\\n\\t throw new Error('setTimeout has not been defined');\\n\\t}\",\n \"function defaultSetTimout() {\\n\\t throw new Error('setTimeout has not been defined');\\n\\t}\",\n \"function defaultSetTimout() {\\n\\t throw new Error('setTimeout has not been defined');\\n\\t}\",\n \"function defaultSetTimout() {\\n\\t throw new Error('setTimeout has not been defined');\\n\\t}\",\n \"function defaultSetTimout() {\\n\\t throw new Error('setTimeout has not been defined');\\n\\t}\",\n \"scheduleRefresh() {}\",\n \"scheduleRefresh() {}\",\n \"_scheduleSendResponseMessage() {\\n\\n }\",\n \"function schedule () {\\n var future = next()\\n var delta = Math.max(future.diff(moment()), 1000)\\n\\n debug(name + ': next run in ' + ms(delta) +\\n ' at ' + future.format('llll Z'))\\n\\n if (timer) clearTimeout(timer)\\n timer = setTimeout(run, delta)\\n }\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n }\",\n \"function updateTimeout()\\n {\\n clearTimeout(timeout);\\n timeout = setTimeout(function()\\n {\\n self.refresh();\\n// }, 30*1000)\\n }, 60 * 60 * 1000);\\n }\",\n \"constructor(timeout) {\\n this.initialTimeout = timeout\\n this.reset()\\n }\",\n \"function clearExistingTimeout() {\\n if (timeoutID) {\\n clearTimeout(timeoutID);\\n }\\n } // Function to cancel next exec\",\n \"constructor(timeout_in_secs) {\\n this.initial_timeout_in_secs = timeout_in_secs\\n this.reset()\\n }\",\n \"_resumeTimeout() {\\n\\t\\tif (this._delayTime > 0) {\\n\\t\\t\\tthis._startDelayTime = new Date();\\n\\t\\t\\tthis._timer = setTimeout(() => {\\n\\t\\t\\t\\tthis.close();\\n\\t\\t\\t}, this._delayTime);\\n\\t\\t}\\n\\t}\",\n \"function stopSchedule() {\\n window.clearTimeout(wrt.scheduleTimeout);\\n window.clearTimeout(wrt.updateTimeout);\\n setUpdateMessage('');\\n wrt.isScheduled = false;\\n }\",\n \"function clearExistingTimeout() {\\n\\t if (timeoutID) {\\n\\t clearTimeout(timeoutID);\\n\\t }\\n\\t } // Function to cancel next exec\",\n \"function clearExistingTimeout() {\\n\\t if (timeoutID) {\\n\\t clearTimeout(timeoutID);\\n\\t }\\n\\t } // Function to cancel next exec\",\n \"function setTimeoutForEvents() {\\n\\t\\tfor(var channel in events) {\\n\\t\\t\\tif(carsts[channel]) {\\n\\t\\t\\t\\tevents[channel].forEach(function (event) {\\n\\t\\t\\t\\t\\tsetTimeoutForEvent(event);\\n\\t\\t\\t\\t});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsetTimeout(setTimeoutForEvents, 86400000);\\n\\t}\",\n \"function timeoutShim(callback) {\\n window.setTimeout(callback, 1000/(storm.animationInterval || 20));\\n }\",\n \"UnscheduleAt(time){\\n \\tconsole.log(\\\"unschedule\\\");\\n }\",\n \"function I(){return a.setTimeout(function(){eb=void 0}),eb=fa.now()}\",\n \"function setTimeout(callback, timeout) {return callback()} // TODO\",\n \"function clearExistingTimeout() {\\n if (timeoutID) {\\n clearTimeout(timeoutID);\\n }\\n } // Function to cancel next exec\",\n \"function clearExistingTimeout() {\\n if (timeoutID) {\\n clearTimeout(timeoutID);\\n }\\n } // Function to cancel next exec\",\n \"function clearExistingTimeout() {\\n if (timeoutID) {\\n clearTimeout(timeoutID);\\n }\\n } // Function to cancel next exec\",\n \"function clearExistingTimeout() {\\n if (timeoutID) {\\n clearTimeout(timeoutID);\\n }\\n } // Function to cancel next exec\",\n \"function clearExistingTimeout() {\\n if (timeoutID) {\\n clearTimeout(timeoutID);\\n }\\n } // Function to cancel next exec\",\n \"function clearExistingTimeout() {\\n if (timeoutID) {\\n clearTimeout(timeoutID);\\n }\\n } // Function to cancel next exec\",\n \"function clearExistingTimeout() {\\n if (timeoutID) {\\n clearTimeout(timeoutID);\\n }\\n } // Function to cancel next exec\",\n \"function schedule() {\\n var now = new Date().getTime(), delta = now - lastCycleTime, timeout = (30 * 60 * 1000) - delta, then = new Date(now + timeout);\\n if (timeout < 100) timeout = 100;\\n setTimeout(start, timeout);\\n console.log(\\\"\\\\nNext cycle time:\\\", then.toLocaleString());\\n}\",\n \"function tweakWaitTime(t) {\\n t += (t*Math.random()/5*(Math.random()>.5 ? 1 : -1));\\n // now we need to tweak the start time to avoid a timing problem in htmlservice \\n // .. never start one within 750ms of the last one.\\n var now = new Date().getTime();\\n startTime_ = Math.max(now + t, startTime_+750);\\n return startTime_ - now;\\n }\",\n \"function executeAfterTime(name, time, randomTimeLimit){\\n setInterval(function () {\\n sendAfterTime(name, 3000);\\n }, time, randomTimeLimit);\\n}\",\n \"function setTime(time) {\\n timeout = time;\\n}\",\n \"createMaxWaitTimer(waitTime) {\\n this.cancelMaxWaitTimer();\\n \\n this.retryMaxTimer = this.service.$setTimer(() => {\\n let continueRetry;\\n if (this.retryMaxTimeCallback && typeof (this.retryMaxTimeCallback) === \\\"function\\\") {\\n let result = this.retryMaxTimeCallback();\\n continueRetry = result && result === true;\\n }\\n \\n if (!continueRetry) {\\n this.cancel('Max time reached');\\n this.service.logMessage(`Max wait time reached caller opted to cancel retry. Operation ${this.name} cancelled.`);\\n } else {\\n this.service.logMessage(`Max wait time reached caller opted to continue retry. Operation ${this.name} continuing`);\\n }\\n }, waitTime);\\n }\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"static timeout(ms) {\\n const signal = new AbortSignal();\\n const timer = setTimeout(abortSignal, ms, signal);\\n // Prevent the active Timer from keeping the Node.js event loop active.\\n if (typeof timer.unref === \\\"function\\\") {\\n timer.unref();\\n }\\n return signal;\\n }\",\n \"static timeout(ms) {\\n const signal = new AbortSignal();\\n const timer = setTimeout(abortSignal, ms, signal);\\n // Prevent the active Timer from keeping the Node.js event loop active.\\n if (typeof timer.unref === \\\"function\\\") {\\n timer.unref();\\n }\\n return signal;\\n }\",\n \"static timeout(ms) {\\n const signal = new AbortSignal();\\n const timer = setTimeout(abortSignal, ms, signal);\\n // Prevent the active Timer from keeping the Node.js event loop active.\\n if (typeof timer.unref === \\\"function\\\") {\\n timer.unref();\\n }\\n return signal;\\n }\",\n \"eventTimer() {throw new Error('Must declare the function')}\",\n \"function _on_timeout(){\\n\\t anchor.finish_wait();\\n\\t}\",\n \"function delayed() {\\n // if we're executing at the end of the detection period\\n if (!execAsap)\\n func.apply(obj, args); // execute now\\n // clear timeout handle\\n timeout = null;\\n }\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"function defaultSetTimout() {\\n throw new Error('setTimeout has not been defined');\\n}\",\n \"scheduleWatchMessages() {\\n this.cronJob = schedule(checkFrequency, this.checkNewMessages.bind(this), {});\\n }\",\n \"setTimeout(callback, delay){\\n\\t\\tthis.game.time.events.add(delay, (function(){callback()}), this.game)\\n\\t}\",\n \"function updateTimeouts() {\\n const timeouts = getSortedTimeouts();\\n if (timeouts.length == 0) {\\n printTimeouts(discordClient, timeoutChannelId);\\n return;\\n }\\n let i = 0;\\n // Mitigate a race condition with the cron job. The cron job throws an error\\n // if the wake time is in the past, so remove people one minute early and hope\\n // the cron gets started before the next closest time passes.\\n const now = util.addMinutes(new Date(), 1);\\n while (i < timeouts.length && timeouts[i].timeout < now) {\\n removeUser(timeouts[i]);\\n i++;\\n }\\n\\n if (i < timeouts.length) {\\n setCronTimeout(timeouts[i].timeout);\\n } else {\\n console.log('No more timeouts, not starting cron job');\\n }\\n\\n printTimeouts(discordClient, timeoutChannelId);\\n}\",\n \"function callbackWrapper() {\\n var diff = startTime + timeout - Date.now();\\n\\n if (diff > 0) {\\n var newTimeout = self.cronTime.getTimeout();\\n\\n if (newTimeout > diff) {\\n newTimeout = diff;\\n }\\n\\n remaining += newTimeout;\\n } // If there is sleep time remaining, calculate how long and go to sleep\\n // again. This processing might make us miss the deadline by a few ms\\n // times the number of sleep sessions. Given a MAXDELAY of almost a\\n // month, this should be no issue.\\n\\n\\n self.lastExecution = new Date();\\n\\n if (remaining) {\\n if (remaining > MAXDELAY) {\\n remaining -= MAXDELAY;\\n timeout = MAXDELAY;\\n } else {\\n timeout = remaining;\\n remaining = 0;\\n }\\n\\n _setTimeout(timeout);\\n } else {\\n // We have arrived at the correct point in time.\\n self.running = false; // start before calling back so the callbacks have the ability to stop the cron job\\n\\n if (!self.runOnce) self.start();\\n self.fireOnTick();\\n }\\n }\",\n \"function accuse_timeout(player_name, index) {\\n players[index].claim_timeout();\\n}\",\n \"static timeout(t) {\\n if ( !(typeof t === 'undefined' ))\\n _timeout = t;\\n else\\n return _timeout;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7186767","0.6903256","0.6726437","0.642659","0.64253235","0.6383911","0.62639284","0.6259933","0.62280244","0.6226642","0.6201523","0.6201523","0.617181","0.61546135","0.61085117","0.6095036","0.60944223","0.60881335","0.60881335","0.6076965","0.6067652","0.6064426","0.6063557","0.60586095","0.6051407","0.6051407","0.6051407","0.60249597","0.601788","0.60142004","0.6001357","0.5999204","0.5989051","0.5988061","0.5978157","0.5978157","0.5978157","0.5978157","0.5978157","0.5978157","0.5978157","0.5978157","0.59654987","0.59654987","0.59619534","0.59598005","0.5955898","0.59518516","0.5949172","0.5928799","0.5919061","0.5909684","0.5898529","0.588515","0.588515","0.58801126","0.58791965","0.58758867","0.5868385","0.5861017","0.58346105","0.58346105","0.58346105","0.58346105","0.58346105","0.58346105","0.58346105","0.58207947","0.581726","0.5815942","0.5812034","0.5808572","0.5802758","0.5802758","0.5799372","0.5799372","0.5799372","0.57977194","0.5795792","0.57910275","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.578197","0.5776374","0.5773236","0.5768086","0.5758393","0.57581663","0.5750111"],"string":"[\n \"0.7186767\",\n \"0.6903256\",\n \"0.6726437\",\n \"0.642659\",\n \"0.64253235\",\n \"0.6383911\",\n \"0.62639284\",\n \"0.6259933\",\n \"0.62280244\",\n \"0.6226642\",\n \"0.6201523\",\n \"0.6201523\",\n \"0.617181\",\n \"0.61546135\",\n \"0.61085117\",\n \"0.6095036\",\n \"0.60944223\",\n \"0.60881335\",\n \"0.60881335\",\n \"0.6076965\",\n \"0.6067652\",\n \"0.6064426\",\n \"0.6063557\",\n \"0.60586095\",\n \"0.6051407\",\n \"0.6051407\",\n \"0.6051407\",\n \"0.60249597\",\n \"0.601788\",\n \"0.60142004\",\n \"0.6001357\",\n \"0.5999204\",\n \"0.5989051\",\n \"0.5988061\",\n \"0.5978157\",\n \"0.5978157\",\n \"0.5978157\",\n \"0.5978157\",\n \"0.5978157\",\n \"0.5978157\",\n \"0.5978157\",\n \"0.5978157\",\n \"0.59654987\",\n \"0.59654987\",\n \"0.59619534\",\n \"0.59598005\",\n \"0.5955898\",\n \"0.59518516\",\n \"0.5949172\",\n \"0.5928799\",\n \"0.5919061\",\n \"0.5909684\",\n \"0.5898529\",\n \"0.588515\",\n \"0.588515\",\n \"0.58801126\",\n \"0.58791965\",\n \"0.58758867\",\n \"0.5868385\",\n \"0.5861017\",\n \"0.58346105\",\n \"0.58346105\",\n \"0.58346105\",\n \"0.58346105\",\n \"0.58346105\",\n \"0.58346105\",\n \"0.58346105\",\n \"0.58207947\",\n \"0.581726\",\n \"0.5815942\",\n \"0.5812034\",\n \"0.5808572\",\n \"0.5802758\",\n \"0.5802758\",\n \"0.5799372\",\n \"0.5799372\",\n \"0.5799372\",\n \"0.57977194\",\n \"0.5795792\",\n \"0.57910275\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.578197\",\n \"0.5776374\",\n \"0.5773236\",\n \"0.5768086\",\n \"0.5758393\",\n \"0.57581663\",\n \"0.5750111\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5791,"cells":{"query":{"kind":"string","value":"requestWork is called by the scheduler whenever a root receives an update. It's up to the renderer to call renderRoot at some point in the future."},"document":{"kind":"string","value":"function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpiration(expirationTime);}}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpiration(expirationTime);}}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n performWorkOnRoot(root, Sync);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else if (!isCallbackScheduled) {\n isCallbackScheduled = true;\n startRequestCallbackTimer();\n scheduleDeferredCallback(performAsyncWork);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n performWorkOnRoot(root, Sync);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else if (!isCallbackScheduled) {\n isCallbackScheduled = true;\n startRequestCallbackTimer();\n scheduleDeferredCallback(performAsyncWork);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n performWorkOnRoot(root, Sync);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else if (!isCallbackScheduled) {\n isCallbackScheduled = true;\n startRequestCallbackTimer();\n scheduleDeferredCallback(performAsyncWork);\n }\n }","function requestWork(root, expirationTime) {\n\t if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n\t invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n\t }\n\t\n\t // Add the root to the schedule.\n\t // Check if this root is already part of the schedule.\n\t if (root.nextScheduledRoot === null) {\n\t // This root is not already scheduled. Add it.\n\t root.remainingExpirationTime = expirationTime;\n\t if (lastScheduledRoot === null) {\n\t firstScheduledRoot = lastScheduledRoot = root;\n\t root.nextScheduledRoot = root;\n\t } else {\n\t lastScheduledRoot.nextScheduledRoot = root;\n\t lastScheduledRoot = root;\n\t lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n\t }\n\t } else {\n\t // This root is already scheduled, but its priority may have increased.\n\t var remainingExpirationTime = root.remainingExpirationTime;\n\t if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n\t // Update the priority.\n\t root.remainingExpirationTime = expirationTime;\n\t }\n\t }\n\t\n\t if (isRendering) {\n\t // Prevent reentrancy. Remaining work will be scheduled at the end of\n\t // the currently rendering batch.\n\t return;\n\t }\n\t\n\t if (isBatchingUpdates) {\n\t // Flush work at the end of the batch.\n\t if (isUnbatchingUpdates) {\n\t // ...unless we're inside unbatchedUpdates, in which case we should\n\t // flush it now.\n\t nextFlushedRoot = root;\n\t nextFlushedExpirationTime = Sync;\n\t performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n\t }\n\t return;\n\t }\n\t\n\t // TODO: Get rid of Sync and use current time?\n\t if (expirationTime === Sync) {\n\t performWork(Sync, null);\n\t } else {\n\t scheduleCallbackWithExpiration(expirationTime);\n\t }\n\t }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n performWorkOnRoot(root, Sync);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else if (!isCallbackScheduled) {\n isCallbackScheduled = true;\n scheduleDeferredCallback(performAsyncWork);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n performWorkOnRoot(root, Sync);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else if (!isCallbackScheduled) {\n isCallbackScheduled = true;\n scheduleDeferredCallback(performAsyncWork);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n }\n else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n\n return;\n } // TODO: Get rid of Sync and use current time?\n\n\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n\n return;\n } // TODO: Get rid of Sync and use current time?\n\n\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n\n return;\n } // TODO: Get rid of Sync and use current time?\n\n\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, true);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, true);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, true);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, true);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, true);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, true);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, true);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, true);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\n }\n\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (root.nextScheduledRoot === null) {\n // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime;\n if (lastScheduledRoot === null) {\n firstScheduledRoot = lastScheduledRoot = root;\n root.nextScheduledRoot = root;\n } else {\n lastScheduledRoot.nextScheduledRoot = root;\n lastScheduledRoot = root;\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\n }\n } else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\n // Update the priority.\n root.remainingExpirationTime = expirationTime;\n }\n }\n\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performWork(Sync, null);\n } else {\n scheduleCallbackWithExpiration(expirationTime);\n }\n }","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root, expirationTime) {\n addRootToSchedule(root, expirationTime);\n if (isRendering) {\n // Prevent reentrancy. Remaining work will be scheduled at the end of\n // the currently rendering batch.\n return;\n }\n\n if (isBatchingUpdates) {\n // Flush work at the end of the batch.\n if (isUnbatchingUpdates) {\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n nextFlushedRoot = root;\n nextFlushedExpirationTime = Sync;\n performWorkOnRoot(root, Sync, false);\n }\n return;\n }\n\n // TODO: Get rid of Sync and use current time?\n if (expirationTime === Sync) {\n performSyncWork();\n } else {\n scheduleCallbackWithExpirationTime(root, expirationTime);\n }\n}","function requestWork(root,expirationTime){if(nestedUpdateCount>NESTED_UPDATE_LIMIT){invariant(false,'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');}// Add the root to the schedule.\n\t// Check if this root is already part of the schedule.\n\tif(root.nextScheduledRoot===null){// This root is not already scheduled. Add it.\n\troot.remainingExpirationTime=expirationTime;if(lastScheduledRoot===null){firstScheduledRoot=lastScheduledRoot=root;root.nextScheduledRoot=root;}else{lastScheduledRoot.nextScheduledRoot=root;lastScheduledRoot=root;lastScheduledRoot.nextScheduledRoot=firstScheduledRoot;}}else{// This root is already scheduled, but its priority may have increased.\n\tvar remainingExpirationTime=root.remainingExpirationTime;if(remainingExpirationTime===NoWork||expirationTime<remainingExpirationTime){// Update the priority.\n\troot.remainingExpirationTime=expirationTime;}}if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n\t// the currently rendering batch.\n\treturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\n\tif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n\t// flush it now.\n\tnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(nextFlushedRoot,nextFlushedExpirationTime);}return;}// TODO: Get rid of Sync and use current time?\n\tif(expirationTime===Sync){performWork(Sync,null);}else{scheduleCallbackWithExpiration(expirationTime);}}","function requestWork(root,expirationTime){if(nestedUpdateCount>NESTED_UPDATE_LIMIT){invariant(false,'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');}// Add the root to the schedule.\n// Check if this root is already part of the schedule.\nif(root.nextScheduledRoot===null){// This root is not already scheduled. Add it.\nroot.remainingExpirationTime=expirationTime;if(lastScheduledRoot===null){firstScheduledRoot=lastScheduledRoot=root;root.nextScheduledRoot=root;}else{lastScheduledRoot.nextScheduledRoot=root;lastScheduledRoot=root;lastScheduledRoot.nextScheduledRoot=firstScheduledRoot;}}else{// This root is already scheduled, but its priority may have increased.\nvar remainingExpirationTime=root.remainingExpirationTime;if(remainingExpirationTime===NoWork||expirationTime<remainingExpirationTime){// Update the priority.\nroot.remainingExpirationTime=expirationTime;}}if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(nextFlushedRoot,nextFlushedExpirationTime);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performWork(Sync,null);}else{scheduleCallbackWithExpiration(expirationTime);}}","function requestWork(root,expirationTime){if(nestedUpdateCount>NESTED_UPDATE_LIMIT){invariant(false,'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');}// Add the root to the schedule.\n// Check if this root is already part of the schedule.\nif(root.nextScheduledRoot===null){// This root is not already scheduled. Add it.\nroot.remainingExpirationTime=expirationTime;if(lastScheduledRoot===null){firstScheduledRoot=lastScheduledRoot=root;root.nextScheduledRoot=root;}else{lastScheduledRoot.nextScheduledRoot=root;lastScheduledRoot=root;lastScheduledRoot.nextScheduledRoot=firstScheduledRoot;}}else{// This root is already scheduled, but its priority may have increased.\nvar remainingExpirationTime=root.remainingExpirationTime;if(remainingExpirationTime===NoWork||expirationTime<remainingExpirationTime){// Update the priority.\nroot.remainingExpirationTime=expirationTime;}}if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(nextFlushedRoot,nextFlushedExpirationTime);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performWork(Sync,null);}else{scheduleCallbackWithExpiration(expirationTime);}}","function requestWork(root, expirationTime) {\n // Add the root to the schedule.\n // Check if this root is already part of the schedule.\n if (nestedUpdateCount > 1e3 && invariant(!1, \"Maximum update depth exceeded. This can happen when a \" + \"component repeatedly calls setState inside componentWillUpdate or \" + \"componentDidUpdate. React limits the number of nested updates to \" + \"prevent infinite loops.\"), \n null === root.nextScheduledRoot) // This root is not already scheduled. Add it.\n root.remainingExpirationTime = expirationTime, null === lastScheduledRoot ? (firstScheduledRoot = lastScheduledRoot = root, \n root.nextScheduledRoot = root) : (lastScheduledRoot.nextScheduledRoot = root, lastScheduledRoot = root, \n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot); else {\n // This root is already scheduled, but its priority may have increased.\n var remainingExpirationTime = root.remainingExpirationTime;\n (remainingExpirationTime === NoWork$3 || expirationTime < remainingExpirationTime) && (// Update the priority.\n root.remainingExpirationTime = expirationTime);\n }\n if (!isRendering) // Flush work at the end of the batch.\n // ...unless we're inside unbatchedUpdates, in which case we should\n // flush it now.\n // TODO: Get rid of Sync and use current time?\n return isBatchingUpdates ? void (isUnbatchingUpdates && performWorkOnRoot(root, Sync$1)) : void (expirationTime === Sync$1 ? performWork(Sync$1, null) : isCallbackScheduled || (isCallbackScheduled = !0, \n scheduleDeferredCallback(performAsyncWork)));\n }","function performSyncWorkOnRoot(root) {\n if (!((executionContext & (RenderContext | CommitContext)) === NoContext)) {\n {\n throw Error(\"Should not already be working.\");\n }\n }\n flushPassiveEffects();\n var lanes;\n var exitStatus;\n if (root === workInProgressRoot && includesSomeLane(root.expiredLanes, workInProgressRootRenderLanes)) {\n // There's a partial tree, and at least one of its lanes has expired. Finish\n // rendering it before rendering the rest of the expired work.\n lanes = workInProgressRootRenderLanes;\n exitStatus = renderRootSync(root, lanes);\n if (includesSomeLane(workInProgressRootIncludedLanes, workInProgressRootUpdatedLanes)) {\n // The render included lanes that were updated during the render phase.\n // For example, when unhiding a hidden tree, we include all the lanes\n // that were previously skipped when the tree was hidden. That set of\n // lanes is a superset of the lanes we started rendering with.\n // \n // Note that this only happens when part of the tree is rendered\n // concurrently. If the whole tree is rendered synchronously, then there\n // are no interleaved events.\n lanes = getNextLanes(root, lanes);\n exitStatus = renderRootSync(root, lanes);\n }\n } else {\n lanes = getNextLanes(root, NoLanes);\n exitStatus = renderRootSync(root, lanes);\n }\n if (root.tag !== LegacyRoot && exitStatus === RootErrored) {\n executionContext |= RetryAfterError;\n // If an error occurred during hydration,\n // discard server response and fall back to client side render.\n if (root.hydrate) {\n root.hydrate = false;\n clearContainer(root.containerInfo);\n }\n // If something threw an error, try rendering one more time. We'll render\n // synchronously to block concurrent data mutations, and we'll includes\n // all pending updates are included. If it still fails after the second\n // attempt, we'll give up and commit the resulting tree.\n lanes = getLanesToRetrySynchronouslyOnError(root);\n if (lanes !== NoLanes) {\n exitStatus = renderRootSync(root, lanes);\n }\n }\n if (exitStatus === RootFatalErrored) {\n var fatalError = workInProgressRootFatalError;\n prepareFreshStack(root, NoLanes);\n markRootSuspended$1(root, lanes);\n ensureRootIsScheduled(root, now());\n throw fatalError;\n }\n // We now have a consistent tree. Because this is a sync render, we\n // will commit it even if something suspended.\n var finishedWork = root.current.alternate;\n root.finishedWork = finishedWork;\n root.finishedLanes = lanes;\n commitRoot(root);\n // Before exiting, make sure there's a callback scheduled for the next\n // pending level.\n ensureRootIsScheduled(root, now());\n return null;\n }"],"string":"[\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n performWorkOnRoot(root, Sync);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else if (!isCallbackScheduled) {\\n isCallbackScheduled = true;\\n startRequestCallbackTimer();\\n scheduleDeferredCallback(performAsyncWork);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n performWorkOnRoot(root, Sync);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else if (!isCallbackScheduled) {\\n isCallbackScheduled = true;\\n startRequestCallbackTimer();\\n scheduleDeferredCallback(performAsyncWork);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n performWorkOnRoot(root, Sync);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else if (!isCallbackScheduled) {\\n isCallbackScheduled = true;\\n startRequestCallbackTimer();\\n scheduleDeferredCallback(performAsyncWork);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n\\t if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n\\t invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n\\t }\\n\\t\\n\\t // Add the root to the schedule.\\n\\t // Check if this root is already part of the schedule.\\n\\t if (root.nextScheduledRoot === null) {\\n\\t // This root is not already scheduled. Add it.\\n\\t root.remainingExpirationTime = expirationTime;\\n\\t if (lastScheduledRoot === null) {\\n\\t firstScheduledRoot = lastScheduledRoot = root;\\n\\t root.nextScheduledRoot = root;\\n\\t } else {\\n\\t lastScheduledRoot.nextScheduledRoot = root;\\n\\t lastScheduledRoot = root;\\n\\t lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n\\t }\\n\\t } else {\\n\\t // This root is already scheduled, but its priority may have increased.\\n\\t var remainingExpirationTime = root.remainingExpirationTime;\\n\\t if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n\\t // Update the priority.\\n\\t root.remainingExpirationTime = expirationTime;\\n\\t }\\n\\t }\\n\\t\\n\\t if (isRendering) {\\n\\t // Prevent reentrancy. Remaining work will be scheduled at the end of\\n\\t // the currently rendering batch.\\n\\t return;\\n\\t }\\n\\t\\n\\t if (isBatchingUpdates) {\\n\\t // Flush work at the end of the batch.\\n\\t if (isUnbatchingUpdates) {\\n\\t // ...unless we're inside unbatchedUpdates, in which case we should\\n\\t // flush it now.\\n\\t nextFlushedRoot = root;\\n\\t nextFlushedExpirationTime = Sync;\\n\\t performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n\\t }\\n\\t return;\\n\\t }\\n\\t\\n\\t // TODO: Get rid of Sync and use current time?\\n\\t if (expirationTime === Sync) {\\n\\t performWork(Sync, null);\\n\\t } else {\\n\\t scheduleCallbackWithExpiration(expirationTime);\\n\\t }\\n\\t }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n performWorkOnRoot(root, Sync);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else if (!isCallbackScheduled) {\\n isCallbackScheduled = true;\\n scheduleDeferredCallback(performAsyncWork);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n performWorkOnRoot(root, Sync);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else if (!isCallbackScheduled) {\\n isCallbackScheduled = true;\\n scheduleDeferredCallback(performAsyncWork);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n }\\n else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n\\n return;\\n } // TODO: Get rid of Sync and use current time?\\n\\n\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n\\n return;\\n } // TODO: Get rid of Sync and use current time?\\n\\n\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n\\n return;\\n } // TODO: Get rid of Sync and use current time?\\n\\n\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, true);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, true);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, true);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, true);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, true);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, true);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, true);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, true);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n if (nestedUpdateCount > NESTED_UPDATE_LIMIT) {\\n invariant(false, 'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');\\n }\\n\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (root.nextScheduledRoot === null) {\\n // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime;\\n if (lastScheduledRoot === null) {\\n firstScheduledRoot = lastScheduledRoot = root;\\n root.nextScheduledRoot = root;\\n } else {\\n lastScheduledRoot.nextScheduledRoot = root;\\n lastScheduledRoot = root;\\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot;\\n }\\n } else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n if (remainingExpirationTime === NoWork || expirationTime < remainingExpirationTime) {\\n // Update the priority.\\n root.remainingExpirationTime = expirationTime;\\n }\\n }\\n\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(nextFlushedRoot, nextFlushedExpirationTime);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performWork(Sync, null);\\n } else {\\n scheduleCallbackWithExpiration(expirationTime);\\n }\\n }\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root, expirationTime) {\\n addRootToSchedule(root, expirationTime);\\n if (isRendering) {\\n // Prevent reentrancy. Remaining work will be scheduled at the end of\\n // the currently rendering batch.\\n return;\\n }\\n\\n if (isBatchingUpdates) {\\n // Flush work at the end of the batch.\\n if (isUnbatchingUpdates) {\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n nextFlushedRoot = root;\\n nextFlushedExpirationTime = Sync;\\n performWorkOnRoot(root, Sync, false);\\n }\\n return;\\n }\\n\\n // TODO: Get rid of Sync and use current time?\\n if (expirationTime === Sync) {\\n performSyncWork();\\n } else {\\n scheduleCallbackWithExpirationTime(root, expirationTime);\\n }\\n}\",\n \"function requestWork(root,expirationTime){if(nestedUpdateCount>NESTED_UPDATE_LIMIT){invariant(false,'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');}// Add the root to the schedule.\\n\\t// Check if this root is already part of the schedule.\\n\\tif(root.nextScheduledRoot===null){// This root is not already scheduled. Add it.\\n\\troot.remainingExpirationTime=expirationTime;if(lastScheduledRoot===null){firstScheduledRoot=lastScheduledRoot=root;root.nextScheduledRoot=root;}else{lastScheduledRoot.nextScheduledRoot=root;lastScheduledRoot=root;lastScheduledRoot.nextScheduledRoot=firstScheduledRoot;}}else{// This root is already scheduled, but its priority may have increased.\\n\\tvar remainingExpirationTime=root.remainingExpirationTime;if(remainingExpirationTime===NoWork||expirationTime<remainingExpirationTime){// Update the priority.\\n\\troot.remainingExpirationTime=expirationTime;}}if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n\\t// the currently rendering batch.\\n\\treturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\n\\tif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n\\t// flush it now.\\n\\tnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(nextFlushedRoot,nextFlushedExpirationTime);}return;}// TODO: Get rid of Sync and use current time?\\n\\tif(expirationTime===Sync){performWork(Sync,null);}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function requestWork(root,expirationTime){if(nestedUpdateCount>NESTED_UPDATE_LIMIT){invariant(false,'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');}// Add the root to the schedule.\\n// Check if this root is already part of the schedule.\\nif(root.nextScheduledRoot===null){// This root is not already scheduled. Add it.\\nroot.remainingExpirationTime=expirationTime;if(lastScheduledRoot===null){firstScheduledRoot=lastScheduledRoot=root;root.nextScheduledRoot=root;}else{lastScheduledRoot.nextScheduledRoot=root;lastScheduledRoot=root;lastScheduledRoot.nextScheduledRoot=firstScheduledRoot;}}else{// This root is already scheduled, but its priority may have increased.\\nvar remainingExpirationTime=root.remainingExpirationTime;if(remainingExpirationTime===NoWork||expirationTime<remainingExpirationTime){// Update the priority.\\nroot.remainingExpirationTime=expirationTime;}}if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(nextFlushedRoot,nextFlushedExpirationTime);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performWork(Sync,null);}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function requestWork(root,expirationTime){if(nestedUpdateCount>NESTED_UPDATE_LIMIT){invariant(false,'Maximum update depth exceeded. This can happen when a component repeatedly calls setState inside componentWillUpdate or componentDidUpdate. React limits the number of nested updates to prevent infinite loops.');}// Add the root to the schedule.\\n// Check if this root is already part of the schedule.\\nif(root.nextScheduledRoot===null){// This root is not already scheduled. Add it.\\nroot.remainingExpirationTime=expirationTime;if(lastScheduledRoot===null){firstScheduledRoot=lastScheduledRoot=root;root.nextScheduledRoot=root;}else{lastScheduledRoot.nextScheduledRoot=root;lastScheduledRoot=root;lastScheduledRoot.nextScheduledRoot=firstScheduledRoot;}}else{// This root is already scheduled, but its priority may have increased.\\nvar remainingExpirationTime=root.remainingExpirationTime;if(remainingExpirationTime===NoWork||expirationTime<remainingExpirationTime){// Update the priority.\\nroot.remainingExpirationTime=expirationTime;}}if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(nextFlushedRoot,nextFlushedExpirationTime);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performWork(Sync,null);}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function requestWork(root, expirationTime) {\\n // Add the root to the schedule.\\n // Check if this root is already part of the schedule.\\n if (nestedUpdateCount > 1e3 && invariant(!1, \\\"Maximum update depth exceeded. This can happen when a \\\" + \\\"component repeatedly calls setState inside componentWillUpdate or \\\" + \\\"componentDidUpdate. React limits the number of nested updates to \\\" + \\\"prevent infinite loops.\\\"), \\n null === root.nextScheduledRoot) // This root is not already scheduled. Add it.\\n root.remainingExpirationTime = expirationTime, null === lastScheduledRoot ? (firstScheduledRoot = lastScheduledRoot = root, \\n root.nextScheduledRoot = root) : (lastScheduledRoot.nextScheduledRoot = root, lastScheduledRoot = root, \\n lastScheduledRoot.nextScheduledRoot = firstScheduledRoot); else {\\n // This root is already scheduled, but its priority may have increased.\\n var remainingExpirationTime = root.remainingExpirationTime;\\n (remainingExpirationTime === NoWork$3 || expirationTime < remainingExpirationTime) && (// Update the priority.\\n root.remainingExpirationTime = expirationTime);\\n }\\n if (!isRendering) // Flush work at the end of the batch.\\n // ...unless we're inside unbatchedUpdates, in which case we should\\n // flush it now.\\n // TODO: Get rid of Sync and use current time?\\n return isBatchingUpdates ? void (isUnbatchingUpdates && performWorkOnRoot(root, Sync$1)) : void (expirationTime === Sync$1 ? performWork(Sync$1, null) : isCallbackScheduled || (isCallbackScheduled = !0, \\n scheduleDeferredCallback(performAsyncWork)));\\n }\",\n \"function performSyncWorkOnRoot(root) {\\n if (!((executionContext & (RenderContext | CommitContext)) === NoContext)) {\\n {\\n throw Error(\\\"Should not already be working.\\\");\\n }\\n }\\n flushPassiveEffects();\\n var lanes;\\n var exitStatus;\\n if (root === workInProgressRoot && includesSomeLane(root.expiredLanes, workInProgressRootRenderLanes)) {\\n // There's a partial tree, and at least one of its lanes has expired. Finish\\n // rendering it before rendering the rest of the expired work.\\n lanes = workInProgressRootRenderLanes;\\n exitStatus = renderRootSync(root, lanes);\\n if (includesSomeLane(workInProgressRootIncludedLanes, workInProgressRootUpdatedLanes)) {\\n // The render included lanes that were updated during the render phase.\\n // For example, when unhiding a hidden tree, we include all the lanes\\n // that were previously skipped when the tree was hidden. That set of\\n // lanes is a superset of the lanes we started rendering with.\\n // \\n // Note that this only happens when part of the tree is rendered\\n // concurrently. If the whole tree is rendered synchronously, then there\\n // are no interleaved events.\\n lanes = getNextLanes(root, lanes);\\n exitStatus = renderRootSync(root, lanes);\\n }\\n } else {\\n lanes = getNextLanes(root, NoLanes);\\n exitStatus = renderRootSync(root, lanes);\\n }\\n if (root.tag !== LegacyRoot && exitStatus === RootErrored) {\\n executionContext |= RetryAfterError;\\n // If an error occurred during hydration,\\n // discard server response and fall back to client side render.\\n if (root.hydrate) {\\n root.hydrate = false;\\n clearContainer(root.containerInfo);\\n }\\n // If something threw an error, try rendering one more time. We'll render\\n // synchronously to block concurrent data mutations, and we'll includes\\n // all pending updates are included. If it still fails after the second\\n // attempt, we'll give up and commit the resulting tree.\\n lanes = getLanesToRetrySynchronouslyOnError(root);\\n if (lanes !== NoLanes) {\\n exitStatus = renderRootSync(root, lanes);\\n }\\n }\\n if (exitStatus === RootFatalErrored) {\\n var fatalError = workInProgressRootFatalError;\\n prepareFreshStack(root, NoLanes);\\n markRootSuspended$1(root, lanes);\\n ensureRootIsScheduled(root, now());\\n throw fatalError;\\n }\\n // We now have a consistent tree. Because this is a sync render, we\\n // will commit it even if something suspended.\\n var finishedWork = root.current.alternate;\\n root.finishedWork = finishedWork;\\n root.finishedLanes = lanes;\\n commitRoot(root);\\n // Before exiting, make sure there's a callback scheduled for the next\\n // pending level.\\n ensureRootIsScheduled(root, now());\\n return null;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7653651","0.7653651","0.7631918","0.7631918","0.7631918","0.7145129","0.7145129","0.7145129","0.7100897","0.70825034","0.70758003","0.70758003","0.70758003","0.70758003","0.70758003","0.70758003","0.70758003","0.70758003","0.70758003","0.70758003","0.70758003","0.70758003","0.7074568","0.7074568","0.7059274","0.7047848","0.7047848","0.7047848","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.6988717","0.69844276","0.69844276","0.69844276","0.69844276","0.69844276","0.69844276","0.69844276","0.69844276","0.69836146","0.69836146","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6982714","0.6874077","0.68602645","0.68602645","0.67446315","0.6498802"],"string":"[\n \"0.7653651\",\n \"0.7653651\",\n \"0.7631918\",\n \"0.7631918\",\n \"0.7631918\",\n \"0.7145129\",\n \"0.7145129\",\n \"0.7145129\",\n \"0.7100897\",\n \"0.70825034\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.70758003\",\n \"0.7074568\",\n \"0.7074568\",\n \"0.7059274\",\n \"0.7047848\",\n \"0.7047848\",\n \"0.7047848\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.6988717\",\n \"0.69844276\",\n \"0.69844276\",\n \"0.69844276\",\n \"0.69844276\",\n \"0.69844276\",\n \"0.69844276\",\n \"0.69844276\",\n \"0.69844276\",\n \"0.69836146\",\n \"0.69836146\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6982714\",\n \"0.6874077\",\n \"0.68602645\",\n \"0.68602645\",\n \"0.67446315\",\n \"0.6498802\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7050717"},"document_rank":{"kind":"string","value":"33"}}},{"rowIdx":5792,"cells":{"query":{"kind":"string","value":"When working on async work, the reconciler asks the renderer if it should yield execution. For DOM, we implement this with requestIdleCallback."},"document":{"kind":"string","value":"function shouldYield() {\n if (deadline === null) {\n return false;\n }\n if (deadline.timeRemaining() > timeHeuristicForUnitOfWork) {\n // Disregard deadline.didTimeout. Only expired work should be flushed\n // during a timeout. This path is only hit for non-expired work.\n return false;\n }\n deadlineDidExpire = true;\n return true;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["onIdle (callback) {\n\t\tif (Object.keys (this.taskMap).length <= 0) {\n\t\t\tsetImmediate (callback);\n\t\t\treturn;\n\t\t}\n\t\tthis.statusEventEmitter.once (IdleEvent, callback);\n\t}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpiration(expirationTime);}}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpiration(expirationTime);}}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}","function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\n// flush it now.\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}","handleRenderCompletion() {\n this.renderNewChildren = false;\n this.preventUpdate = false;\n this.lastChildIndex = this.childCount;\n if (this.isRenderingNew) {\n this.isRenderingNew = false;\n this.update(null, false, true); // Prevent from triggering an item request to avoid infinite loop of loading.\n } else if (this.contentNode && InfiniteUtils.shouldTriggerItemRequest(InfiniteUtils.getContentData(this.contentNode))) {\n this.triggerItemRequest();\n }\n }","static whenDOMUpdated() {\n\t\tif (renderTaskPromise) {\n\t\t\treturn renderTaskPromise;\n\t\t}\n\n\t\trenderTaskPromise = new Promise(resolve => {\n\t\t\trenderTaskPromiseResolve = resolve;\n\t\t\twindow.requestAnimationFrame(() => {\n\t\t\t\tif (invalidatedWebComponents.getList().length === 0) {\n\t\t\t\t\trenderTaskPromise = undefined;\n\t\t\t\t\tresolve();\n\t\t\t\t}\n\t\t\t});\n\t\t});\n\n\t\treturn renderTaskPromise;\n\t}","function renderCallback() {\n\n while (TO_RENDER.length) {\n TO_RENDER.shift().notify();\n }\n\n TO_RENDER.added = {};\n\n while (ENV_QUEUE.length) {\n var env = ENV_QUEUE.shift();\n for (var key in env.revalidateQueue) {\n env.revalidateQueue[key].revalidate();\n }\n reslot(env);\n }\n ENV_QUEUE.added = {};\n}","IsFinishedRendering() {}","function shouldYield(){if(deadline===null){return false;}if(deadline.timeRemaining()>timeHeuristicForUnitOfWork){// Disregard deadline.didTimeout. Only expired work should be flushed\n// during a timeout. This path is only hit for non-expired work.\nreturn false;}deadlineDidExpire=true;return true;}// TODO: Not happy about this hook. Conceptually, renderRoot should return a","function shouldYield(){if(deadline===null){return false;}if(deadline.timeRemaining()>timeHeuristicForUnitOfWork){// Disregard deadline.didTimeout. Only expired work should be flushed\n// during a timeout. This path is only hit for non-expired work.\nreturn false;}deadlineDidExpire=true;return true;}// TODO: Not happy about this hook. Conceptually, renderRoot should return a","function main() \n{\n\trender();\n\t// Request to do this again ASAP\n\trequestAnimationFrame(main);\n}","initEvents() {\n return __awaiter(this, void 0, void 0, function* () {\n yield Promise.all([\n this.renderMathJax(),\n this.renderZenUML(),\n this.renderWavedrom(),\n ]);\n this.previewElement.innerHTML = this.hiddenPreviewElement.innerHTML;\n this.hiddenPreviewElement.innerHTML = \"\";\n yield Promise.all([\n this.renderFlowchart(),\n this.renderInteractiveVega(),\n this.renderSequenceDiagram(),\n this.renderMermaid(),\n ]);\n this.setupCodeChunks();\n if (this.refreshingIconTimeout) {\n clearTimeout(this.refreshingIconTimeout);\n this.refreshingIconTimeout = null;\n }\n this.refreshingIcon.style.display = \"none\";\n });\n }","function cb () {\n\t\tcallback();\n\t}","mainLoop() {\n return new Promise((resolve, reject) => {\n renderLoop(() => {\n // switch to another scene\n if (G.scene !== this) {\n G.lock.sceneSwitch = true;\n resolve();\n return false;\n }\n this.calcRepaintItems();\n this.update();\n });\n });\n }","_requestIfNeeded() {\n if (this._requestId === null && this._head.next) {\n // ensure callbacks get correct delta\n this.lastTime = performance.now();\n this._requestId = requestAnimationFrame(this._tick);\n }\n }","async work() {\n await this.waitLoading();\n this.onInitialize();\n await this.fadeIn();\n await this.mainLoop();\n await this.fadeOut();\n this.onTerminate();\n this.repaintListGC();\n }","forceUpdate() {\n if (this[_queuedUpdate]) {\n this[_dirty] = true;\n return;\n }\n\n this[_virtualRender]();\n this[_queuedUpdate] = true;\n\n TaskQueue.push(() => {\n if (this[_dirty] && !this.isDisposed) {\n this[_virtualRender]();\n this[_dirty] = false;\n }\n this[_queuedUpdate] = false;\n });\n }","idle() {\n this.sync();\n }","function async_io_normal(cb) {\n\n}","_run(cb) {\n cb();\n }","_run(cb) {\n cb();\n }","function YCurrentLoopOutput_get_currentAtStartUp_async(callback,context)\n {\n var res; // double;\n var loadcb; // func;\n loadcb = function(ctx,obj,res) {\n if (res != YAPI_SUCCESS) {\n callback(context, obj, Y_CURRENTATSTARTUP_INVALID);\n } else {\n callback(context, obj, obj._currentAtStartUp);\n }\n };\n if (this._cacheExpiration <= YAPI.GetTickCount()) {\n this.load_async(YAPI.defaultCacheValidity,loadcb,null);\n } else {\n loadcb(null, this, YAPI_SUCCESS);\n }\n }","function work() {\n\t\t// Set running to true to prevent more calls until the first one is done\n\t\trunning = true;\n\t\t\n\t\t// Go through the DOM\n\t\twalk(document.body);\n\n\t\t// Set running to false to allow additional calls\n\t\trunning = false;\n\t}","static scheduleRenderTask() {\n\t\tif (!renderTaskId) {\n\t\t\t// renderTaskId = window.setTimeout(RenderScheduler.renderWebComponents, 3000); // Task\n\t\t\t// renderTaskId = Promise.resolve().then(RenderScheduler.renderWebComponents); // Micro task\n\t\t\trenderTaskId = window.requestAnimationFrame(RenderScheduler.renderWebComponents); // AF\n\t\t}\n\t}","_notifyRenderer() {\n this.renderer.notify();\n }","if (\n workInProgressSuspendedReason === SuspendedOnData &&\n workInProgressRoot === root\n ) {\n // Mark the root as ready to continue rendering.\n workInProgressSuspendedReason = SuspendedAndReadyToContinue;\n }","scheduleIdleCallback() {\n if (!this.idleScheduled) {\n ChromeUtils.idleDispatch(this.onIdle, {timeout: LOW_PRIORITY_TIMEOUT_MS});\n this.idleScheduled = true;\n }\n }","function main () {\n var now = Date.now()\n var delta = now - then\n\n update(delta / 1000)\n render()\n\n then = now\n\n // Request to do this again ASAP\n window.requestAnimationFrame(main)\n}","callback() {\n if (this.stop) {this.is_running=false;return;}\n this.debuglog(\"Stage:\",this.stage);\n this.debuglog(\"Async:\",this.async_requests);\n this.debuglog(\"ID:\",this.id);\n //Don't check for more processing until the last task called is done\n if (this.async_requests !== 0) {\n if (this.last_logged != this.async_requests) {\n this.alllog(`Requests remaining: ${this.async_requests}`);\n this.last_logged = this.async_requests;\n }\n var me = this;\n setTimeout(()=>{me.callback();},polling_interval);\n this.debuglog(\"Rescheduled\");\n } else {\n this.processList();\n }\n }","main() {\n // let browser handle frames\n var _this = this;\n var loop = function(tFrame){\n _this.animationFrameId = window.requestAnimationFrame( loop );\n _this.emit(\"Core::update\");\n }\n loop();\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n workInProgress = performUnitOfWork(workInProgress);\n }\n }","function resumeRender() {\n shouldRender = true;\n render();\n }","function recursivelyCallNextOnIterator(data) {\n var yielded = iterator.next.apply(iterator, arguments);\n // yielded = { value: Any, done: Boolean }\n\n if (yielded.done) {\n taskInstance.isIdle = true;\n taskInstance.isRunning = false;\n // call setState with the same state to trigger another render\n // so that you can use task properties like isIdle directly\n // in your render function\n component.setState(component.state);\n return;\n }\n\n if (isPromise(yielded.value)) {\n yielded.value.then(function (data) {\n if (component._isMounted) {\n recursivelyCallNextOnIterator(data);\n }\n }, function (e) {\n if (component._isMounted) {\n iterator.throw(e);\n }\n });\n }\n }","_postProcessing() {\n // None yet...\n }","function YCurrentLoopOutput_get_current_async(callback,context)\n {\n var res; // double;\n var loadcb; // func;\n loadcb = function(ctx,obj,res) {\n if (res != YAPI_SUCCESS) {\n callback(context, obj, Y_CURRENT_INVALID);\n } else {\n callback(context, obj, obj._current);\n }\n };\n if (this._cacheExpiration <= YAPI.GetTickCount()) {\n this.load_async(YAPI.defaultCacheValidity,loadcb,null);\n } else {\n loadcb(null, this, YAPI_SUCCESS);\n }\n }","async function afterNextPaint() {\n\t// Usually, we just advise raf + setTimeout(0) here...\n\t// But I'm using yield() for highest odds to get scheduled.\n\t// The first \"real\" requestPostAnimationFrame() polyfill? :)\n\treturn new Promise(resolve => requestAnimationFrame(async () => {\n\t\tawait scheduler.yield();\n\t\tresolve();\n\t}));\n}","function doSomethingAfterRendering(){\n displayLoading() // 로딩화면 보여주기\n fetchServer(); // 서버에서 데이터 가져오기\n }","function shouldYield(){if(deadline===null){return false;}if(deadline.timeRemaining()>timeHeuristicForUnitOfWork){// Disregard deadline.didTimeout. Only expired work should be flushed\n\t// during a timeout. This path is only hit for non-expired work.\n\treturn false;}deadlineDidExpire=true;return true;}// TODO: Not happy about this hook. Conceptually, renderRoot should return a","function callbackSelf() {\n\t\tsetTimeout( regenFn(scrollFriendsAsync, args), 1000 );\n\t}","__fireLoadEvent() {\n this.__requestId++;\n qx.bom.AnimationFrame.request(\n function (rId) {\n // prevent firing of the event if source changed in the meantime\n if (rId === this.__requestId) {\n this.fireEvent(\"loaded\");\n } else {\n this.fireEvent(\"aborted\");\n }\n }.bind(this, this.__requestId)\n );\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n workInProgress = performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n workInProgress = performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n workInProgress = performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n workInProgress = performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n workInProgress = performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n workInProgress = performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n workInProgress = performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n performUnitOfWork(workInProgress);\n }\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n performUnitOfWork(workInProgress);\n }\n }","run(self, cb) {\n const context = this.fiberContext(self);\n context.runAsync(cb || empty);\n }","function main () {\n\tvar now = Date.now();\n\tvar delta = now - then;\n\n\tupdate(delta / 1000);\n\trender(Math.round(1 / (delta / 1000)));\n\n\tthen = now;\n\n\t// Request to do this again ASAP\n\trequestAnimationFrame(main);\n}","function asyncExecute(fn) {\n if ((typeof document !== \"undefined\" && document !== null) && (document.hidden || document.msHidden) && nonAsyncCount++ < 10000) {\n fn();\n }\n else {\n nonAsyncCount = 0;\n setImmediate(fn);\n }\n }","function asyncInIE (f) {\n f();\n }","function ensureExecutionAfterAjaxRequest(callback) {\n if (!requestOngoing) {\n callback();\n } else {\n onCompleteCallbacks.push(callback);\n }\n }","function softPoll() {\n var readyState = page.evaluate(function () {\n return document.readyState;\n });\n\n if (readyState === \"complete\") {\n process();\n } else {\n setTimeout(softPoll);\n }\n }","requestTileAsync() {}","function iris_request(args, callback) {\n if (document.webkitVisibilityState == 'prerender' ||\n document.visibilityState == 'prerender' ||\n document.visibilityState[0] == 'prerender') {\n alert('Disable prerendering');\n }\n\n var requestDiv = document.getElementById('iris_request_div');\n\n var requestEvent = document.createEvent('Event');\n requestEvent.initEvent('iris_request_event', true, true);\n\n requestDiv.addEventListener('iris_response_event', function() {\n var response = JSON.parse(requestDiv.innerText);\n callback(response);\n });\n\n requestDiv.innerText = JSON.stringify(args);\n requestDiv.dispatchEvent(requestEvent);\n}","renderDone() {\n const signal = {};\n signal.name = 'ArfHtml5';\n signal.type = 'onload';\n signal.iframeId = window.frameElement.id;\n parent.window.postMessage(signal, '*');\n }","rendererReady() {\n const message = new Message(Message.rendererReadyTitle, 'void').toString();\n this.ipc.send('update-message', message);\n }","function doRun(){// run may have just been called through dependencies being fulfilled just in this very frame,\n // or while the async setStatus time below was happening\n if(calledRun)return;calledRun=true;Module['calledRun']=true;if(ABORT)return;initRuntime();preMain();readyPromiseResolve(Module);if(Module['onRuntimeInitialized'])Module['onRuntimeInitialized']();postRun();}","waitToFetch (callback) {\n\t\tsetTimeout(callback, 10000);\n\t}","async function initialRender() {\n\tawait getFromDB();\n\trender();\n}","detachedCallback() {}","detachedCallback() {}","detachedCallback() {}","detachedCallback() {}","detachedCallback() {}","detachedCallback() {}","function flushToDom() {\n var oldDebounceRendering = n.debounceRendering; // orig\n var callbackQ = [];\n function execCallbackSync(callback) {\n callbackQ.push(callback);\n }\n n.debounceRendering = execCallbackSync;\n O(v(FakeComponent, {}), document.createElement('div'));\n while (callbackQ.length) {\n callbackQ.shift()();\n }\n n.debounceRendering = oldDebounceRendering;\n }","async next() {\n this._executing = false;\n await this._execute();\n }","function render (renderInternal) {\n var rafId = null;\n return function () {\n if (rafId == null) {\n rafId = requestAnimationFrame(function () {\n rafId = null;\n renderInternal();\n });\n }\n };\n }","async function asyncWrapperFunction() {\r\n await htmlRouting();\r\n await videoRouting();\r\n const data = await dataProcessing();\r\n const nodes = await nodesGetting();\r\n dynamic(data,nodes);\r\n display(data,nodes);\r\n}","function assetsLoadingLoop(callback) {\n\n if (assetsStillLoading) {\n requestAnimationFrame(assetsLoadingLoop.bind(this, callback));\n } else {\n callback();\n }\n\n}","onEditorChange() {\n // If the handler is in standby mode, bail.\n if (this._standby) {\n return;\n }\n const editor = this.editor;\n if (!editor) {\n return;\n }\n const text = editor.model.value.text;\n const position = editor.getCursorPosition();\n const offset = Text.jsIndexToCharIndex(editor.getOffsetAt(position), text);\n const update = { content: null };\n const pending = ++this._pending;\n void this._connector\n .fetch({ offset, text })\n .then(reply => {\n // If handler has been disposed or a newer request is pending, bail.\n if (this.isDisposed || pending !== this._pending) {\n this._inspected.emit(update);\n return;\n }\n const { data } = reply;\n const mimeType = this._rendermime.preferredMimeType(data);\n if (mimeType) {\n const widget = this._rendermime.createRenderer(mimeType);\n const model = new MimeModel({ data });\n void widget.renderModel(model);\n update.content = widget;\n }\n this._inspected.emit(update);\n })\n .catch(reason => {\n // Since almost all failures are benign, fail silently.\n this._inspected.emit(update);\n });\n }","function enterModificationReal() {\n\t suspendEvents += 1;\n\t }","function enterModificationReal() {\n\t suspendEvents += 1;\n\t }","_doTransitionToIdle() {\n return false\n }","function enterModificationReal() {\n suspendEvents += 1;\n }","function enterModificationReal() {\n suspendEvents += 1;\n }","function callbackDriver() {\n cb();\n }","async onLoad() {}","function callback() {}","function callback() {}","function callback() {}","function callback() {}","function callback() {}","onBeforeRendering() {}","onRenderDone() {\n const {\n scheduler,\n rowMap\n } = this,\n visibleEventDOMConfigs = []; // Concat all rows event configs\n\n rowMap.forEach(eventDOMConfigs => visibleEventDOMConfigs.push.apply(visibleEventDOMConfigs, eventDOMConfigs));\n DomSync.sync({\n domConfig: {\n onlyChildren: true,\n children: visibleEventDOMConfigs\n },\n targetElement: scheduler.foregroundCanvas,\n syncIdField: 'syncId',\n\n // Called by DomHelper when it creates, releases or reuses elements\n callback({\n action,\n domConfig,\n lastDomConfig,\n targetElement\n }) {\n var _domConfig$className;\n\n // If element is a task wrap, trigger appropriate events\n if (action !== 'none' && (domConfig === null || domConfig === void 0 ? void 0 : (_domConfig$className = domConfig.className) === null || _domConfig$className === void 0 ? void 0 : _domConfig$className[`${scheduler.eventCls}-wrap`])) {\n const // Some actions are considered first a release and then a render (reusing another element).\n // This gives clients code a chance to clean up before reusing an element\n isRelease = releaseEventActions[action],\n isRender = renderEventActions[action]; // Trigger release for events (it might be a proxy element, skip those)\n\n if (isRelease && (lastDomConfig === null || lastDomConfig === void 0 ? void 0 : lastDomConfig.elementData)) {\n const {\n eventRecord,\n resourceRecord,\n assignmentRecord\n } = lastDomConfig.elementData,\n event = {\n renderData: lastDomConfig.elementData,\n element: targetElement,\n eventRecord,\n resourceRecord,\n assignmentRecord\n }; // Some browsers do not blur on set to display:none, so releasing the active element\n // must *explicitly* move focus outwards to the view.\n\n if (targetElement === document.activeElement) {\n scheduler.focusElement.focus();\n } // This event is documented on Scheduler\n\n scheduler.trigger('releaseEvent', event);\n }\n\n if (isRender) {\n const {\n eventRecord,\n resourceRecord,\n assignmentRecord\n } = domConfig.elementData,\n event = {\n renderData: domConfig.elementData,\n tplData: domConfig.elementData,\n // DEPRECATED IN 4.0\n element: targetElement,\n isReusingElement: action === 'reuseElement',\n isRepaint: action === 'reuseOwnElement',\n eventRecord,\n resourceRecord,\n assignmentRecord\n }; // This event is documented on Scheduler\n\n scheduler.trigger('renderEvent', event);\n }\n }\n }\n\n }); // There are multiple pathways that might lead to the first render of events. This is the first reliable\n // place were we can determine that something will be rendered\n\n visibleEventDOMConfigs.length && scheduler._firstRenderDone && scheduler._firstRenderDone();\n }","async connectedCallback() {\n const ctor = this.constructor;\n this.setAttribute(`_ui5rt${(0, _Runtimes.getCurrentRuntimeIndex)()}`, \"\");\n this.setAttribute(\"_ui5host\", \"\");\n this.setAttribute(ctor.getMetadata().getPureTag(), \"\");\n if (ctor.getMetadata().supportsF6FastNavigation()) {\n this.setAttribute(\"data-sap-ui-fastnavgroup\", \"true\");\n }\n const slotsAreManaged = ctor.getMetadata().slotsAreManaged();\n this._inDOM = true;\n if (slotsAreManaged) {\n // always register the observer before yielding control to the main thread (await)\n this._startObservingDOMChildren();\n await this._processChildren();\n }\n if (!this._inDOM) {\n // Component removed from DOM while _processChildren was running\n return;\n }\n (0, _Render.renderImmediately)(this);\n this._domRefReadyPromise._deferredResolve();\n this._fullyConnected = true;\n this.onEnterDOM();\n }","function render() {\n busy = true;\n var old_run = run;\n run = false; // no more calls until this one is done!\n\n init_svg();\n\n invoke_rpc('/render', [ghosting,scale*svg_width,scale*svg_height], 500, function (data) {\n last_data = data;\n if (emoji) display(data);\n run = old_run; // okay to enable further timesteps now\n busy = false;\n });\n}","function render() {\n if (!willRender) {\n willRender = true;\n process.nextTick(function() {\n screen.render();\n willRender = false;\n });\n }\n}","async function event_loop(){\n setGlobal('JS_running', 'true');\n debugging = parseInt(global('Debugging'));\n \n // if (debugging) {flash()}\n let promise_list = []; // running fns\n let once = true;\n \n while (true) {\n let queue_str = global('JS_queue');\n setGlobal('JS_queue', '');\n \n if (queue_str) {\n let queue = queue_str.split(',');\n\n if (debugging) {flash('Queue String: ' + queue_str + '\\nQueue length: ' + queue.length)}\n\n promise_list = launch_functions(queue, promise_list);\n \n } else { \n // if (debugging) {flash(promise_list)}\n let should_break = check_running(promise_list);\n if (should_break) {break}\n }\n await sleep(200);\n } \n exiting();\n}","load() {\n this.loadEventLoop(600)\n }","function maybeFinish() {\n if (waiting) return;\n callback();\n }","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n performUnitOfWork(workInProgress);\n }\n}","function workLoopSync() {\n // Already timed out, so perform work without checking if we need to yield.\n while (workInProgress !== null) {\n performUnitOfWork(workInProgress);\n }\n}"],"string":"[\n \"onIdle (callback) {\\n\\t\\tif (Object.keys (this.taskMap).length <= 0) {\\n\\t\\t\\tsetImmediate (callback);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tthis.statusEventEmitter.once (IdleEvent, callback);\\n\\t}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpiration(expirationTime);}}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}\",\n \"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\\n// the currently rendering batch.\\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\\nif(isUnbatchingUpdates){// ...unless we're inside unbatchedUpdates, in which case we should\\n// flush it now.\\nnextFlushedRoot=root;nextFlushedExpirationTime=Sync;performWorkOnRoot(root,Sync,false);}return;}// TODO: Get rid of Sync and use current time?\\nif(expirationTime===Sync){performSyncWork();}else{scheduleCallbackWithExpirationTime(root,expirationTime);}}\",\n \"handleRenderCompletion() {\\n this.renderNewChildren = false;\\n this.preventUpdate = false;\\n this.lastChildIndex = this.childCount;\\n if (this.isRenderingNew) {\\n this.isRenderingNew = false;\\n this.update(null, false, true); // Prevent from triggering an item request to avoid infinite loop of loading.\\n } else if (this.contentNode && InfiniteUtils.shouldTriggerItemRequest(InfiniteUtils.getContentData(this.contentNode))) {\\n this.triggerItemRequest();\\n }\\n }\",\n \"static whenDOMUpdated() {\\n\\t\\tif (renderTaskPromise) {\\n\\t\\t\\treturn renderTaskPromise;\\n\\t\\t}\\n\\n\\t\\trenderTaskPromise = new Promise(resolve => {\\n\\t\\t\\trenderTaskPromiseResolve = resolve;\\n\\t\\t\\twindow.requestAnimationFrame(() => {\\n\\t\\t\\t\\tif (invalidatedWebComponents.getList().length === 0) {\\n\\t\\t\\t\\t\\trenderTaskPromise = undefined;\\n\\t\\t\\t\\t\\tresolve();\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t});\\n\\n\\t\\treturn renderTaskPromise;\\n\\t}\",\n \"function renderCallback() {\\n\\n while (TO_RENDER.length) {\\n TO_RENDER.shift().notify();\\n }\\n\\n TO_RENDER.added = {};\\n\\n while (ENV_QUEUE.length) {\\n var env = ENV_QUEUE.shift();\\n for (var key in env.revalidateQueue) {\\n env.revalidateQueue[key].revalidate();\\n }\\n reslot(env);\\n }\\n ENV_QUEUE.added = {};\\n}\",\n \"IsFinishedRendering() {}\",\n \"function shouldYield(){if(deadline===null){return false;}if(deadline.timeRemaining()>timeHeuristicForUnitOfWork){// Disregard deadline.didTimeout. Only expired work should be flushed\\n// during a timeout. This path is only hit for non-expired work.\\nreturn false;}deadlineDidExpire=true;return true;}// TODO: Not happy about this hook. Conceptually, renderRoot should return a\",\n \"function shouldYield(){if(deadline===null){return false;}if(deadline.timeRemaining()>timeHeuristicForUnitOfWork){// Disregard deadline.didTimeout. Only expired work should be flushed\\n// during a timeout. This path is only hit for non-expired work.\\nreturn false;}deadlineDidExpire=true;return true;}// TODO: Not happy about this hook. Conceptually, renderRoot should return a\",\n \"function main() \\n{\\n\\trender();\\n\\t// Request to do this again ASAP\\n\\trequestAnimationFrame(main);\\n}\",\n \"initEvents() {\\n return __awaiter(this, void 0, void 0, function* () {\\n yield Promise.all([\\n this.renderMathJax(),\\n this.renderZenUML(),\\n this.renderWavedrom(),\\n ]);\\n this.previewElement.innerHTML = this.hiddenPreviewElement.innerHTML;\\n this.hiddenPreviewElement.innerHTML = \\\"\\\";\\n yield Promise.all([\\n this.renderFlowchart(),\\n this.renderInteractiveVega(),\\n this.renderSequenceDiagram(),\\n this.renderMermaid(),\\n ]);\\n this.setupCodeChunks();\\n if (this.refreshingIconTimeout) {\\n clearTimeout(this.refreshingIconTimeout);\\n this.refreshingIconTimeout = null;\\n }\\n this.refreshingIcon.style.display = \\\"none\\\";\\n });\\n }\",\n \"function cb () {\\n\\t\\tcallback();\\n\\t}\",\n \"mainLoop() {\\n return new Promise((resolve, reject) => {\\n renderLoop(() => {\\n // switch to another scene\\n if (G.scene !== this) {\\n G.lock.sceneSwitch = true;\\n resolve();\\n return false;\\n }\\n this.calcRepaintItems();\\n this.update();\\n });\\n });\\n }\",\n \"_requestIfNeeded() {\\n if (this._requestId === null && this._head.next) {\\n // ensure callbacks get correct delta\\n this.lastTime = performance.now();\\n this._requestId = requestAnimationFrame(this._tick);\\n }\\n }\",\n \"async work() {\\n await this.waitLoading();\\n this.onInitialize();\\n await this.fadeIn();\\n await this.mainLoop();\\n await this.fadeOut();\\n this.onTerminate();\\n this.repaintListGC();\\n }\",\n \"forceUpdate() {\\n if (this[_queuedUpdate]) {\\n this[_dirty] = true;\\n return;\\n }\\n\\n this[_virtualRender]();\\n this[_queuedUpdate] = true;\\n\\n TaskQueue.push(() => {\\n if (this[_dirty] && !this.isDisposed) {\\n this[_virtualRender]();\\n this[_dirty] = false;\\n }\\n this[_queuedUpdate] = false;\\n });\\n }\",\n \"idle() {\\n this.sync();\\n }\",\n \"function async_io_normal(cb) {\\n\\n}\",\n \"_run(cb) {\\n cb();\\n }\",\n \"_run(cb) {\\n cb();\\n }\",\n \"function YCurrentLoopOutput_get_currentAtStartUp_async(callback,context)\\n {\\n var res; // double;\\n var loadcb; // func;\\n loadcb = function(ctx,obj,res) {\\n if (res != YAPI_SUCCESS) {\\n callback(context, obj, Y_CURRENTATSTARTUP_INVALID);\\n } else {\\n callback(context, obj, obj._currentAtStartUp);\\n }\\n };\\n if (this._cacheExpiration <= YAPI.GetTickCount()) {\\n this.load_async(YAPI.defaultCacheValidity,loadcb,null);\\n } else {\\n loadcb(null, this, YAPI_SUCCESS);\\n }\\n }\",\n \"function work() {\\n\\t\\t// Set running to true to prevent more calls until the first one is done\\n\\t\\trunning = true;\\n\\t\\t\\n\\t\\t// Go through the DOM\\n\\t\\twalk(document.body);\\n\\n\\t\\t// Set running to false to allow additional calls\\n\\t\\trunning = false;\\n\\t}\",\n \"static scheduleRenderTask() {\\n\\t\\tif (!renderTaskId) {\\n\\t\\t\\t// renderTaskId = window.setTimeout(RenderScheduler.renderWebComponents, 3000); // Task\\n\\t\\t\\t// renderTaskId = Promise.resolve().then(RenderScheduler.renderWebComponents); // Micro task\\n\\t\\t\\trenderTaskId = window.requestAnimationFrame(RenderScheduler.renderWebComponents); // AF\\n\\t\\t}\\n\\t}\",\n \"_notifyRenderer() {\\n this.renderer.notify();\\n }\",\n \"if (\\n workInProgressSuspendedReason === SuspendedOnData &&\\n workInProgressRoot === root\\n ) {\\n // Mark the root as ready to continue rendering.\\n workInProgressSuspendedReason = SuspendedAndReadyToContinue;\\n }\",\n \"scheduleIdleCallback() {\\n if (!this.idleScheduled) {\\n ChromeUtils.idleDispatch(this.onIdle, {timeout: LOW_PRIORITY_TIMEOUT_MS});\\n this.idleScheduled = true;\\n }\\n }\",\n \"function main () {\\n var now = Date.now()\\n var delta = now - then\\n\\n update(delta / 1000)\\n render()\\n\\n then = now\\n\\n // Request to do this again ASAP\\n window.requestAnimationFrame(main)\\n}\",\n \"callback() {\\n if (this.stop) {this.is_running=false;return;}\\n this.debuglog(\\\"Stage:\\\",this.stage);\\n this.debuglog(\\\"Async:\\\",this.async_requests);\\n this.debuglog(\\\"ID:\\\",this.id);\\n //Don't check for more processing until the last task called is done\\n if (this.async_requests !== 0) {\\n if (this.last_logged != this.async_requests) {\\n this.alllog(`Requests remaining: ${this.async_requests}`);\\n this.last_logged = this.async_requests;\\n }\\n var me = this;\\n setTimeout(()=>{me.callback();},polling_interval);\\n this.debuglog(\\\"Rescheduled\\\");\\n } else {\\n this.processList();\\n }\\n }\",\n \"main() {\\n // let browser handle frames\\n var _this = this;\\n var loop = function(tFrame){\\n _this.animationFrameId = window.requestAnimationFrame( loop );\\n _this.emit(\\\"Core::update\\\");\\n }\\n loop();\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n workInProgress = performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function resumeRender() {\\n shouldRender = true;\\n render();\\n }\",\n \"function recursivelyCallNextOnIterator(data) {\\n var yielded = iterator.next.apply(iterator, arguments);\\n // yielded = { value: Any, done: Boolean }\\n\\n if (yielded.done) {\\n taskInstance.isIdle = true;\\n taskInstance.isRunning = false;\\n // call setState with the same state to trigger another render\\n // so that you can use task properties like isIdle directly\\n // in your render function\\n component.setState(component.state);\\n return;\\n }\\n\\n if (isPromise(yielded.value)) {\\n yielded.value.then(function (data) {\\n if (component._isMounted) {\\n recursivelyCallNextOnIterator(data);\\n }\\n }, function (e) {\\n if (component._isMounted) {\\n iterator.throw(e);\\n }\\n });\\n }\\n }\",\n \"_postProcessing() {\\n // None yet...\\n }\",\n \"function YCurrentLoopOutput_get_current_async(callback,context)\\n {\\n var res; // double;\\n var loadcb; // func;\\n loadcb = function(ctx,obj,res) {\\n if (res != YAPI_SUCCESS) {\\n callback(context, obj, Y_CURRENT_INVALID);\\n } else {\\n callback(context, obj, obj._current);\\n }\\n };\\n if (this._cacheExpiration <= YAPI.GetTickCount()) {\\n this.load_async(YAPI.defaultCacheValidity,loadcb,null);\\n } else {\\n loadcb(null, this, YAPI_SUCCESS);\\n }\\n }\",\n \"async function afterNextPaint() {\\n\\t// Usually, we just advise raf + setTimeout(0) here...\\n\\t// But I'm using yield() for highest odds to get scheduled.\\n\\t// The first \\\"real\\\" requestPostAnimationFrame() polyfill? :)\\n\\treturn new Promise(resolve => requestAnimationFrame(async () => {\\n\\t\\tawait scheduler.yield();\\n\\t\\tresolve();\\n\\t}));\\n}\",\n \"function doSomethingAfterRendering(){\\n displayLoading() // 로딩화면 보여주기\\n fetchServer(); // 서버에서 데이터 가져오기\\n }\",\n \"function shouldYield(){if(deadline===null){return false;}if(deadline.timeRemaining()>timeHeuristicForUnitOfWork){// Disregard deadline.didTimeout. Only expired work should be flushed\\n\\t// during a timeout. This path is only hit for non-expired work.\\n\\treturn false;}deadlineDidExpire=true;return true;}// TODO: Not happy about this hook. Conceptually, renderRoot should return a\",\n \"function callbackSelf() {\\n\\t\\tsetTimeout( regenFn(scrollFriendsAsync, args), 1000 );\\n\\t}\",\n \"__fireLoadEvent() {\\n this.__requestId++;\\n qx.bom.AnimationFrame.request(\\n function (rId) {\\n // prevent firing of the event if source changed in the meantime\\n if (rId === this.__requestId) {\\n this.fireEvent(\\\"loaded\\\");\\n } else {\\n this.fireEvent(\\\"aborted\\\");\\n }\\n }.bind(this, this.__requestId)\\n );\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n workInProgress = performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n workInProgress = performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n workInProgress = performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n workInProgress = performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n workInProgress = performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n workInProgress = performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n workInProgress = performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n performUnitOfWork(workInProgress);\\n }\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n performUnitOfWork(workInProgress);\\n }\\n }\",\n \"run(self, cb) {\\n const context = this.fiberContext(self);\\n context.runAsync(cb || empty);\\n }\",\n \"function main () {\\n\\tvar now = Date.now();\\n\\tvar delta = now - then;\\n\\n\\tupdate(delta / 1000);\\n\\trender(Math.round(1 / (delta / 1000)));\\n\\n\\tthen = now;\\n\\n\\t// Request to do this again ASAP\\n\\trequestAnimationFrame(main);\\n}\",\n \"function asyncExecute(fn) {\\n if ((typeof document !== \\\"undefined\\\" && document !== null) && (document.hidden || document.msHidden) && nonAsyncCount++ < 10000) {\\n fn();\\n }\\n else {\\n nonAsyncCount = 0;\\n setImmediate(fn);\\n }\\n }\",\n \"function asyncInIE (f) {\\n f();\\n }\",\n \"function ensureExecutionAfterAjaxRequest(callback) {\\n if (!requestOngoing) {\\n callback();\\n } else {\\n onCompleteCallbacks.push(callback);\\n }\\n }\",\n \"function softPoll() {\\n var readyState = page.evaluate(function () {\\n return document.readyState;\\n });\\n\\n if (readyState === \\\"complete\\\") {\\n process();\\n } else {\\n setTimeout(softPoll);\\n }\\n }\",\n \"requestTileAsync() {}\",\n \"function iris_request(args, callback) {\\n if (document.webkitVisibilityState == 'prerender' ||\\n document.visibilityState == 'prerender' ||\\n document.visibilityState[0] == 'prerender') {\\n alert('Disable prerendering');\\n }\\n\\n var requestDiv = document.getElementById('iris_request_div');\\n\\n var requestEvent = document.createEvent('Event');\\n requestEvent.initEvent('iris_request_event', true, true);\\n\\n requestDiv.addEventListener('iris_response_event', function() {\\n var response = JSON.parse(requestDiv.innerText);\\n callback(response);\\n });\\n\\n requestDiv.innerText = JSON.stringify(args);\\n requestDiv.dispatchEvent(requestEvent);\\n}\",\n \"renderDone() {\\n const signal = {};\\n signal.name = 'ArfHtml5';\\n signal.type = 'onload';\\n signal.iframeId = window.frameElement.id;\\n parent.window.postMessage(signal, '*');\\n }\",\n \"rendererReady() {\\n const message = new Message(Message.rendererReadyTitle, 'void').toString();\\n this.ipc.send('update-message', message);\\n }\",\n \"function doRun(){// run may have just been called through dependencies being fulfilled just in this very frame,\\n // or while the async setStatus time below was happening\\n if(calledRun)return;calledRun=true;Module['calledRun']=true;if(ABORT)return;initRuntime();preMain();readyPromiseResolve(Module);if(Module['onRuntimeInitialized'])Module['onRuntimeInitialized']();postRun();}\",\n \"waitToFetch (callback) {\\n\\t\\tsetTimeout(callback, 10000);\\n\\t}\",\n \"async function initialRender() {\\n\\tawait getFromDB();\\n\\trender();\\n}\",\n \"detachedCallback() {}\",\n \"detachedCallback() {}\",\n \"detachedCallback() {}\",\n \"detachedCallback() {}\",\n \"detachedCallback() {}\",\n \"detachedCallback() {}\",\n \"function flushToDom() {\\n var oldDebounceRendering = n.debounceRendering; // orig\\n var callbackQ = [];\\n function execCallbackSync(callback) {\\n callbackQ.push(callback);\\n }\\n n.debounceRendering = execCallbackSync;\\n O(v(FakeComponent, {}), document.createElement('div'));\\n while (callbackQ.length) {\\n callbackQ.shift()();\\n }\\n n.debounceRendering = oldDebounceRendering;\\n }\",\n \"async next() {\\n this._executing = false;\\n await this._execute();\\n }\",\n \"function render (renderInternal) {\\n var rafId = null;\\n return function () {\\n if (rafId == null) {\\n rafId = requestAnimationFrame(function () {\\n rafId = null;\\n renderInternal();\\n });\\n }\\n };\\n }\",\n \"async function asyncWrapperFunction() {\\r\\n await htmlRouting();\\r\\n await videoRouting();\\r\\n const data = await dataProcessing();\\r\\n const nodes = await nodesGetting();\\r\\n dynamic(data,nodes);\\r\\n display(data,nodes);\\r\\n}\",\n \"function assetsLoadingLoop(callback) {\\n\\n if (assetsStillLoading) {\\n requestAnimationFrame(assetsLoadingLoop.bind(this, callback));\\n } else {\\n callback();\\n }\\n\\n}\",\n \"onEditorChange() {\\n // If the handler is in standby mode, bail.\\n if (this._standby) {\\n return;\\n }\\n const editor = this.editor;\\n if (!editor) {\\n return;\\n }\\n const text = editor.model.value.text;\\n const position = editor.getCursorPosition();\\n const offset = Text.jsIndexToCharIndex(editor.getOffsetAt(position), text);\\n const update = { content: null };\\n const pending = ++this._pending;\\n void this._connector\\n .fetch({ offset, text })\\n .then(reply => {\\n // If handler has been disposed or a newer request is pending, bail.\\n if (this.isDisposed || pending !== this._pending) {\\n this._inspected.emit(update);\\n return;\\n }\\n const { data } = reply;\\n const mimeType = this._rendermime.preferredMimeType(data);\\n if (mimeType) {\\n const widget = this._rendermime.createRenderer(mimeType);\\n const model = new MimeModel({ data });\\n void widget.renderModel(model);\\n update.content = widget;\\n }\\n this._inspected.emit(update);\\n })\\n .catch(reason => {\\n // Since almost all failures are benign, fail silently.\\n this._inspected.emit(update);\\n });\\n }\",\n \"function enterModificationReal() {\\n\\t suspendEvents += 1;\\n\\t }\",\n \"function enterModificationReal() {\\n\\t suspendEvents += 1;\\n\\t }\",\n \"_doTransitionToIdle() {\\n return false\\n }\",\n \"function enterModificationReal() {\\n suspendEvents += 1;\\n }\",\n \"function enterModificationReal() {\\n suspendEvents += 1;\\n }\",\n \"function callbackDriver() {\\n cb();\\n }\",\n \"async onLoad() {}\",\n \"function callback() {}\",\n \"function callback() {}\",\n \"function callback() {}\",\n \"function callback() {}\",\n \"function callback() {}\",\n \"onBeforeRendering() {}\",\n \"onRenderDone() {\\n const {\\n scheduler,\\n rowMap\\n } = this,\\n visibleEventDOMConfigs = []; // Concat all rows event configs\\n\\n rowMap.forEach(eventDOMConfigs => visibleEventDOMConfigs.push.apply(visibleEventDOMConfigs, eventDOMConfigs));\\n DomSync.sync({\\n domConfig: {\\n onlyChildren: true,\\n children: visibleEventDOMConfigs\\n },\\n targetElement: scheduler.foregroundCanvas,\\n syncIdField: 'syncId',\\n\\n // Called by DomHelper when it creates, releases or reuses elements\\n callback({\\n action,\\n domConfig,\\n lastDomConfig,\\n targetElement\\n }) {\\n var _domConfig$className;\\n\\n // If element is a task wrap, trigger appropriate events\\n if (action !== 'none' && (domConfig === null || domConfig === void 0 ? void 0 : (_domConfig$className = domConfig.className) === null || _domConfig$className === void 0 ? void 0 : _domConfig$className[`${scheduler.eventCls}-wrap`])) {\\n const // Some actions are considered first a release and then a render (reusing another element).\\n // This gives clients code a chance to clean up before reusing an element\\n isRelease = releaseEventActions[action],\\n isRender = renderEventActions[action]; // Trigger release for events (it might be a proxy element, skip those)\\n\\n if (isRelease && (lastDomConfig === null || lastDomConfig === void 0 ? void 0 : lastDomConfig.elementData)) {\\n const {\\n eventRecord,\\n resourceRecord,\\n assignmentRecord\\n } = lastDomConfig.elementData,\\n event = {\\n renderData: lastDomConfig.elementData,\\n element: targetElement,\\n eventRecord,\\n resourceRecord,\\n assignmentRecord\\n }; // Some browsers do not blur on set to display:none, so releasing the active element\\n // must *explicitly* move focus outwards to the view.\\n\\n if (targetElement === document.activeElement) {\\n scheduler.focusElement.focus();\\n } // This event is documented on Scheduler\\n\\n scheduler.trigger('releaseEvent', event);\\n }\\n\\n if (isRender) {\\n const {\\n eventRecord,\\n resourceRecord,\\n assignmentRecord\\n } = domConfig.elementData,\\n event = {\\n renderData: domConfig.elementData,\\n tplData: domConfig.elementData,\\n // DEPRECATED IN 4.0\\n element: targetElement,\\n isReusingElement: action === 'reuseElement',\\n isRepaint: action === 'reuseOwnElement',\\n eventRecord,\\n resourceRecord,\\n assignmentRecord\\n }; // This event is documented on Scheduler\\n\\n scheduler.trigger('renderEvent', event);\\n }\\n }\\n }\\n\\n }); // There are multiple pathways that might lead to the first render of events. This is the first reliable\\n // place were we can determine that something will be rendered\\n\\n visibleEventDOMConfigs.length && scheduler._firstRenderDone && scheduler._firstRenderDone();\\n }\",\n \"async connectedCallback() {\\n const ctor = this.constructor;\\n this.setAttribute(`_ui5rt${(0, _Runtimes.getCurrentRuntimeIndex)()}`, \\\"\\\");\\n this.setAttribute(\\\"_ui5host\\\", \\\"\\\");\\n this.setAttribute(ctor.getMetadata().getPureTag(), \\\"\\\");\\n if (ctor.getMetadata().supportsF6FastNavigation()) {\\n this.setAttribute(\\\"data-sap-ui-fastnavgroup\\\", \\\"true\\\");\\n }\\n const slotsAreManaged = ctor.getMetadata().slotsAreManaged();\\n this._inDOM = true;\\n if (slotsAreManaged) {\\n // always register the observer before yielding control to the main thread (await)\\n this._startObservingDOMChildren();\\n await this._processChildren();\\n }\\n if (!this._inDOM) {\\n // Component removed from DOM while _processChildren was running\\n return;\\n }\\n (0, _Render.renderImmediately)(this);\\n this._domRefReadyPromise._deferredResolve();\\n this._fullyConnected = true;\\n this.onEnterDOM();\\n }\",\n \"function render() {\\n busy = true;\\n var old_run = run;\\n run = false; // no more calls until this one is done!\\n\\n init_svg();\\n\\n invoke_rpc('/render', [ghosting,scale*svg_width,scale*svg_height], 500, function (data) {\\n last_data = data;\\n if (emoji) display(data);\\n run = old_run; // okay to enable further timesteps now\\n busy = false;\\n });\\n}\",\n \"function render() {\\n if (!willRender) {\\n willRender = true;\\n process.nextTick(function() {\\n screen.render();\\n willRender = false;\\n });\\n }\\n}\",\n \"async function event_loop(){\\n setGlobal('JS_running', 'true');\\n debugging = parseInt(global('Debugging'));\\n \\n // if (debugging) {flash()}\\n let promise_list = []; // running fns\\n let once = true;\\n \\n while (true) {\\n let queue_str = global('JS_queue');\\n setGlobal('JS_queue', '');\\n \\n if (queue_str) {\\n let queue = queue_str.split(',');\\n\\n if (debugging) {flash('Queue String: ' + queue_str + '\\\\nQueue length: ' + queue.length)}\\n\\n promise_list = launch_functions(queue, promise_list);\\n \\n } else { \\n // if (debugging) {flash(promise_list)}\\n let should_break = check_running(promise_list);\\n if (should_break) {break}\\n }\\n await sleep(200);\\n } \\n exiting();\\n}\",\n \"load() {\\n this.loadEventLoop(600)\\n }\",\n \"function maybeFinish() {\\n if (waiting) return;\\n callback();\\n }\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n performUnitOfWork(workInProgress);\\n }\\n}\",\n \"function workLoopSync() {\\n // Already timed out, so perform work without checking if we need to yield.\\n while (workInProgress !== null) {\\n performUnitOfWork(workInProgress);\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.55923533","0.5583884","0.5583884","0.5555731","0.5555731","0.5555731","0.55458957","0.5499496","0.5457743","0.5456889","0.54464793","0.54464793","0.54398525","0.5432785","0.54193616","0.5402261","0.53944165","0.5393767","0.537789","0.5373993","0.53727627","0.53158736","0.53158736","0.5314808","0.5303453","0.52965385","0.5263111","0.5256006","0.52418894","0.52318394","0.52196693","0.5217187","0.51985013","0.51837647","0.5182544","0.51706034","0.51676977","0.5164861","0.5164702","0.5163143","0.5150413","0.51489615","0.51096946","0.51096946","0.51096946","0.51096946","0.51096946","0.51096946","0.51096946","0.51059324","0.51059324","0.51059324","0.51059324","0.51059324","0.51058185","0.5095115","0.5092604","0.5083162","0.5079135","0.50594443","0.5042726","0.5038292","0.50230354","0.5016776","0.5013893","0.50127244","0.5011131","0.50109583","0.50109583","0.50109583","0.50109583","0.50109583","0.50109583","0.50099903","0.5003248","0.50023985","0.49925557","0.49900052","0.49847397","0.49832484","0.49832484","0.498143","0.49793866","0.49793866","0.49640223","0.4953048","0.4951342","0.4951342","0.4951342","0.4951342","0.4951342","0.49379826","0.49352735","0.4920254","0.49195528","0.49081314","0.4907138","0.49023306","0.4897305","0.4892726","0.4892726"],"string":"[\n \"0.55923533\",\n \"0.5583884\",\n \"0.5583884\",\n \"0.5555731\",\n \"0.5555731\",\n \"0.5555731\",\n \"0.55458957\",\n \"0.5499496\",\n \"0.5457743\",\n \"0.5456889\",\n \"0.54464793\",\n \"0.54464793\",\n \"0.54398525\",\n \"0.5432785\",\n \"0.54193616\",\n \"0.5402261\",\n \"0.53944165\",\n \"0.5393767\",\n \"0.537789\",\n \"0.5373993\",\n \"0.53727627\",\n \"0.53158736\",\n \"0.53158736\",\n \"0.5314808\",\n \"0.5303453\",\n \"0.52965385\",\n \"0.5263111\",\n \"0.5256006\",\n \"0.52418894\",\n \"0.52318394\",\n \"0.52196693\",\n \"0.5217187\",\n \"0.51985013\",\n \"0.51837647\",\n \"0.5182544\",\n \"0.51706034\",\n \"0.51676977\",\n \"0.5164861\",\n \"0.5164702\",\n \"0.5163143\",\n \"0.5150413\",\n \"0.51489615\",\n \"0.51096946\",\n \"0.51096946\",\n \"0.51096946\",\n \"0.51096946\",\n \"0.51096946\",\n \"0.51096946\",\n \"0.51096946\",\n \"0.51059324\",\n \"0.51059324\",\n \"0.51059324\",\n \"0.51059324\",\n \"0.51059324\",\n \"0.51058185\",\n \"0.5095115\",\n \"0.5092604\",\n \"0.5083162\",\n \"0.5079135\",\n \"0.50594443\",\n \"0.5042726\",\n \"0.5038292\",\n \"0.50230354\",\n \"0.5016776\",\n \"0.5013893\",\n \"0.50127244\",\n \"0.5011131\",\n \"0.50109583\",\n \"0.50109583\",\n \"0.50109583\",\n \"0.50109583\",\n \"0.50109583\",\n \"0.50109583\",\n \"0.50099903\",\n \"0.5003248\",\n \"0.50023985\",\n \"0.49925557\",\n \"0.49900052\",\n \"0.49847397\",\n \"0.49832484\",\n \"0.49832484\",\n \"0.498143\",\n \"0.49793866\",\n \"0.49793866\",\n \"0.49640223\",\n \"0.4953048\",\n \"0.4951342\",\n \"0.4951342\",\n \"0.4951342\",\n \"0.4951342\",\n \"0.4951342\",\n \"0.49379826\",\n \"0.49352735\",\n \"0.4920254\",\n \"0.49195528\",\n \"0.49081314\",\n \"0.4907138\",\n \"0.49023306\",\n \"0.4897305\",\n \"0.4892726\",\n \"0.4892726\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5793,"cells":{"query":{"kind":"string","value":"TODO: Batching should be implemented at the renderer level, not inside the reconciler."},"document":{"kind":"string","value":"function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["updateBatches() {\n if (this.dirty === this.cacheDirty) {\n return;\n }\n if (this.graphicsData.length === 0) {\n return;\n }\n if (this.dirty !== this.cacheDirty) {\n for (var i = 0; i < this.graphicsData.length; i++) {\n var data = this.graphicsData[i];\n // reveal(data.fillStyle.texture.baseTexture.resource);\n // reveal(data.lineStyle.texture.baseTexture.resource);\n if (data.fillStyle && !data.fillStyle.texture.baseTexture.valid) {\n return;\n }\n if (data.lineStyle && !data.lineStyle.texture.baseTexture.valid) {\n return;\n }\n }\n }\n this.cacheDirty = this.dirty;\n var uvs = this.uvs;\n var batchPart = this.batches.pop()\n || GraphicsGeometry.BATCH_POOL.pop()\n || new BatchPart();\n batchPart.style = batchPart.style\n || this.graphicsData[0].fillStyle\n || this.graphicsData[0].lineStyle;\n var currentTexture = batchPart.style.texture.baseTexture;\n // reveal(currentTexture);\n var currentColor = batchPart.style.color + batchPart.style.alpha;\n this.batches.push(batchPart);\n // reveal(this.batches);\n // TODO - this can be simplified\n for (var i$1 = this.shapeIndex; i$1 < this.graphicsData.length; i$1++) {\n this.shapeIndex++;\n var data$1 = this.graphicsData[i$1];\n // reveal(data$1);\n var command = GraphicsGeometry.getFillCommand(data$1.type);\n // reveal(command)\n var fillStyle = data$1.fillStyle;\n var lineStyle = data$1.lineStyle;\n // build out the shapes points..\n command.build(data$1);\n if (data$1.matrix) {\n this.transformPoints(data$1.points, data$1.matrix);\n // reveal(data$1.points)\n // \treveal(data$1.matrix)\n }\n for (var j = 0; j < 2; j++) {\n var style = (j === 0) ? fillStyle : lineStyle;\n if (!style.visible) {\n continue;\n }\n var nextTexture = style.texture.baseTexture;\n if (currentTexture !== nextTexture || (style.color + style.alpha) !== currentColor) {\n // TODO use a const\n nextTexture.wrapMode = 10497;\n currentTexture = nextTexture;\n currentColor = style.color + style.alpha;\n var index$1 = this.indices.length;\n var attribIndex = this.points.length / 2;\n batchPart.size = index$1 - batchPart.start;\n batchPart.attribSize = attribIndex - batchPart.attribStart;\n if (batchPart.size > 0) {\n batchPart = GraphicsGeometry.BATCH_POOL.pop() || new BatchPart();\n this.batches.push(batchPart);\n }\n batchPart.style = style;\n batchPart.start = index$1;\n batchPart.attribStart = attribIndex;\n // TODO add this to the render part..\n }\n var start = this.points.length / 2;\n if (j === 0) {\n if (data$1.holes.length) {\n this.processHoles(data$1.holes);\n GraphicsGeometry.buildPoly.triangulate(data$1, this);\n }\n else {\n command.triangulate(data$1, this);\n }\n }\n else {\n GraphicsGeometry.buildLine(data$1, this);\n for (var i$2 = 0; i$2 < data$1.holes.length; i$2++) {\n GraphicsGeometry.buildLine(data$1.holes[i$2], this);\n }\n }\n var size = (this.points.length / 2) - start;\n this.addUvs(this.points, uvs, style.texture, start, size, style.matrix);\n }\n }\n var index = this.indices.length;\n var attrib = this.points.length / 2;\n batchPart.size = index - batchPart.start;\n batchPart.attribSize = attrib - batchPart.attribStart;\n this.indicesUint16 = new Uint16Array(this.indices);\n // TODO make this a const..\n this.batchable = this.isBatchable();\n if (this.batchable) {\n this.batchDirty++;\n this.uvsFloat32 = new Float32Array(this.uvs);\n // offset the indices so that it works with the batcher...\n for (var i$3 = 0; i$3 < this.batches.length; i$3++) {\n var batch = this.batches[i$3];\n for (var j$1 = 0; j$1 < batch.size; j$1++) {\n var index$2 = batch.start + j$1;\n this.indicesUint16[index$2] = this.indicesUint16[index$2] - batch.attribStart;\n }\n }\n }\n else {\n this.buildDrawCalls();\n }\n }","flush() {\n // trace(\"BatchRender flush \" + this.currentSize)\n if (this.currentSize === 0) {\n return;\n }\n var gl = this.renderer.gl;\n var MAX_TEXTURES = this.MAX_TEXTURES;\n var buffer = this.getAttributeBuffer(this.currentSize);\n // reveal(buffer);\n var indexBuffer = this.getIndexBuffer(this.currentIndexSize);\n // reveal(indexBuffer);\n var elements = this.elements;\n var groups = this.groups;\n var float32View = buffer.float32View;\n // reveal(float32View);\n var uint32View = buffer.uint32View;\n // reveal(uint32View);\n var touch = this.renderer.textureGC.count;\n var index = 0;\n var indexCount = 0;\n var nextTexture;\n var currentTexture;\n var groupCount = 0;\n var textureCount = 0;\n var currentGroup = groups[0];\n // reveal(currentGroup);\n var blendMode = -1; // premultiplyBlendMode[elements[0]._texture.baseTexture.premultiplyAlpha ? 0 : ][elements[0].blendMode];\n currentGroup.textureCount = 0;\n currentGroup.start = 0;\n currentGroup.blend = blendMode;\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\n var i;\n for (i = 0; i < this.currentIndex; ++i) {\n // upload the sprite elements...\n // they have all ready been calculated so we just need to push them into the buffer.\n var sprite = elements[i];\n elements[i] = null;\n nextTexture = sprite._texture.baseTexture;\n // reveal(nextTexture);\n var spriteBlendMode = BlendModesSettings_1.BlendModesSettings.premultiplyBlendMode[nextTexture.premultiplyAlpha ? 1 : 0][sprite.blendMode];\n if (blendMode !== spriteBlendMode) {\n blendMode = spriteBlendMode;\n // force the batch to break!\n currentTexture = null;\n textureCount = MAX_TEXTURES;\n TICK++;\n }\n if (currentTexture !== nextTexture) {\n currentTexture = nextTexture;\n if (nextTexture._batchEnabled !== TICK) {\n if (textureCount === MAX_TEXTURES) {\n TICK++;\n textureCount = 0;\n currentGroup.size = indexCount - currentGroup.start;\n currentGroup = groups[groupCount++];\n currentGroup.textureCount = 0;\n currentGroup.blend = blendMode;\n currentGroup.start = indexCount;\n }\n nextTexture.touched = touch;\n nextTexture._batchEnabled = TICK;\n nextTexture._id = textureCount;\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\n // reveal(currentGroup);\n // reveal(nextTexture);\n textureCount++;\n }\n }\n this.packGeometry(sprite, float32View, uint32View, indexBuffer, index, indexCount); // argb, nextTexture._id, float32View, uint32View, indexBuffer, index, indexCount);\n // HERE \n // push a graphics..\n index += (sprite.vertexData.length / 2) * this.vertSize;\n indexCount += sprite.indices.length;\n }\n BaseTexture_1.BaseTexture._globalBatch = TICK;\n currentGroup.size = indexCount - currentGroup.start;\n // this.indexBuffer.update();\n if (!WebGLSettings_1.WebGLSettings.CAN_UPLOAD_SAME_BUFFER) {\n // this is still needed for IOS performance..\n // it really does not like uploading to the same buffer in a single frame!\n if (this.vaoMax <= this.vertexCount) {\n this.vaoMax++;\n /* eslint-disable max-len */\n this.vaos[this.vertexCount] = new BatchGeometry_1.BatchGeometry();\n }\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\n // this.vertexBuffers[this.vertexCount].update(buffer.vertices, 0);\n this.renderer.geometry.bind(this.vaos[this.vertexCount]);\n this.renderer.geometry.updateBuffers();\n this.vertexCount++;\n }\n else {\n // lets use the faster option, always use buffer number 0\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\n // if (true)// this.spriteOnly)\n // {\n // this.vaos[this.vertexCount].indexBuffer = this.defualtSpriteIndexBuffer;\n // this.vaos[this.vertexCount].buffers[1] = this.defualtSpriteIndexBuffer;\n // }\n // this.vaos[0].attributes.aColor.stride = 24\n // this.vaos[0].attributes.aColor.start = 16\n // NOT SET\n // this.vaos[0].attributes.aTextureCoord.stride = 24\n // this.vaos[0].attributes.aTextureCoord.start = 8\n // NOT SET\n // this.vaos[0].attributes.aVertexPosition.stride = 24\n // NOT SET\n this.renderer.geometry.updateBuffers();\n // \n }\n // this.renderer.state.set(this.state);\n var textureSystem = this.renderer.texture;\n var stateSystem = this.renderer.state;\n // e.log(groupCount);\n // / render the groups..\n // trace(\"groupcount: \" + groupCount)\n // trace(\"BatchRenderer count: \" + groupCount)\n for (i = 0; i < groupCount; i++) {\n var group = groups[i];\n var groupTextureCount = group.textureCount;\n for (var j = 0; j < groupTextureCount; j++) {\n // trace(\"possible textureSystem bind call (BathRenderer)\")\n // trace(\"binding: \" + group.textures[j] + \" to \" + j)\n textureSystem.bind(group.textures[j], j);\n group.textures[j] = null;\n }\n // this.state.blendMode = group.blend;\n // this.state.blend = true;\n // this.renderer.state.setState(this.state);\n // set the blend mode..\n stateSystem.setBlendMode(group.blend);\n gl.drawElements(group.type, group.size, gl.UNSIGNED_SHORT, group.start * 2);\n }\n // reset elements for the next flush\n this.currentIndex = 0;\n this.currentSize = 0;\n this.currentIndexSize = 0;\n }","function RenderBatch() {\n\tthis.mRenderData = new Array();\n\t\n\tthis.mNeedSort = false;\n\tthis.mFrustrumCull = true;\n}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\n var ancestors = parent\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\n : [];\n write(function () {\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\n },\n };\n}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\n var ancestors = parent\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\n : [];\n write(function () {\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\n },\n };\n}","function enqueueUpdate(component){ensureInjected();// Various parts of our code (such as ReactCompositeComponent's\n// _renderValidatedComponent) assume that calls to render aren't nested;\n// verify that that's the case. (This is called by each top-level update\n// function, like setState, forceUpdate, etc.; creation and\n// destruction of top-level components is guarded in ReactMount.)\nif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);if(component._updateBatchNumber==null){component._updateBatchNumber=updateBatchNumber+1;}}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n var order = Array.from(queue).sort(compareByDepth);\n if (parent) {\n withoutTreeTransform(parent, function () {\n batchResetAndMeasure(order);\n });\n }\n else {\n batchResetAndMeasure(order);\n }\n /**\n * Write: Notify the VisualElements they're ready for further write operations.\n */\n order.forEach(layoutReady);\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n flushSync.preRender();\n flushSync.render();\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n sync.postRender(function () { return order.forEach(assignProjectionToSnapshot); });\n queue.clear();\n },\n };\n}","function u(e) {\n // Various parts of our code (such as ReactCompositeComponent's\n // _renderValidatedComponent) assume that calls to render aren't nested;\n // verify that that's the case. (This is called by each top-level update\n // function, like setState, forceUpdate, etc.; creation and\n // destruction of top-level components is guarded in ReactMount.)\n if (r(), !C.isBatchingUpdates) return void C.batchedUpdates(u, e);\n v.push(e), null == e._updateBatchNumber && (e._updateBatchNumber = y + 1);\n }","buildDrawCalls() {\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\n for (var i = 0; i < this.drawCalls.length; i++) {\n this.drawCalls[i].textures.length = 0;\n GraphicsGeometry.DRAW_CALL_POOL.push(this.drawCalls[i]);\n }\n this.drawCalls.length = 0;\n var uvs = this.uvs;\n var colors = this.colors;\n var textureIds = this.textureIds;\n var currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\n currentGroup.textureCount = 0;\n currentGroup.start = 0;\n currentGroup.size = 0;\n currentGroup.type = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n var textureCount = 0;\n var currentTexture = null;\n var textureId = 0;\n var native = false;\n var drawMode = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n var index = 0;\n this.drawCalls.push(currentGroup);\n // TODO - this can be simplified\n for (var i$1 = 0; i$1 < this.batches.length; i$1++) {\n var data = this.batches[i$1];\n // TODO add some full on MAX_TEXTURE CODE..\n var MAX_TEXTURES = 8;\n var style = data.style;\n var nextTexture = style.texture.baseTexture;\n if (native !== style.native) {\n native = style.native;\n drawMode = native ? DrawModeSettings_1.DrawModeSettings.DRAW_MODES.LINES : DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n // force the batch to break!\n currentTexture = null;\n textureCount = MAX_TEXTURES;\n TICK++;\n }\n if (currentTexture !== nextTexture) {\n currentTexture = nextTexture;\n if (nextTexture._batchEnabled !== TICK) {\n if (textureCount === MAX_TEXTURES) {\n TICK++;\n textureCount = 0;\n if (currentGroup.size > 0) {\n currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\n this.drawCalls.push(currentGroup);\n }\n currentGroup.start = index;\n currentGroup.size = 0;\n currentGroup.textureCount = 0;\n currentGroup.type = drawMode;\n }\n // TODO add this to the render part..\n nextTexture.touched = 1; // touch;\n nextTexture._batchEnabled = TICK;\n nextTexture._id = textureCount;\n nextTexture.wrapMode = 10497;\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\n textureCount++;\n }\n }\n currentGroup.size += data.size;\n index += data.size;\n textureId = nextTexture._id;\n this.addColors(colors, style.color, style.alpha, data.attribSize);\n this.addTextureIds(textureIds, textureId, data.attribSize);\n }\n BaseTexture_1.BaseTexture._globalBatch = TICK;\n // upload..\n // merge for now!\n var verts = this.points;\n // verts are 2 positions.. so we * by 3 as there are 6 properties.. then 4 cos its bytes\n var glPoints = new ArrayBuffer(verts.length * 3 * 4);\n var f32 = new Float32Array(glPoints);\n var u32 = new Uint32Array(glPoints);\n var p = 0;\n for (var i$2 = 0; i$2 < verts.length / 2; i$2++) {\n f32[p++] = verts[i$2 * 2];\n f32[p++] = verts[(i$2 * 2) + 1];\n f32[p++] = uvs[i$2 * 2];\n f32[p++] = uvs[(i$2 * 2) + 1];\n u32[p++] = colors[i$2];\n f32[p++] = textureIds[i$2];\n }\n this._buffer.update(glPoints);\n this._indexBuffer.update(this.indicesUint16);\n }","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\r\n globalState.inBatch++;\r\n}","function batchedUpdates(fn, a) {\n\t var previousIsBatchingUpdates = isBatchingUpdates;\n\t isBatchingUpdates = true;\n\t try {\n\t return fn(a);\n\t } finally {\n\t isBatchingUpdates = previousIsBatchingUpdates;\n\t if (!isBatchingUpdates && !isRendering) {\n\t performWork(Sync, null);\n\t }\n\t }\n\t }","function addToBatchCache() {\n\t\t\n\t\tTHREE.WebGLBatchCompiler.batchCache.push( new THREE.WebGLBatchCompiler.batchCacheObject( geometry, materials, mesh.webGLBatches, mesh.webGLIsTransparent ));\n\t}","updateRenderers_() {\n this.renderers = this.staticRenderers.concat(this.getDynamicRenderers()).sort(rendererPrioritySort);\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n }\n finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n batchLayout(function (read, write) {\n var order = Array.from(queue).sort(compareByDepth);\n var ancestors = parent\n ? collectProjectingAncestors(parent)\n : [];\n write(function () {\n var allElements = __spreadArray(__spreadArray([], __read(ancestors)), __read(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n flushSync.preRender();\n flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n es.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n flushLayout();\n },\n };\n}","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function _startBatch() {\n ++_batch;\n }","render(delta, spriteBatch) {}","function useBatchFrameState() {\n var _useState = (0,react__WEBPACK_IMPORTED_MODULE_1__.useState)({}),\n _useState2 = (0,_babel_runtime_helpers_esm_slicedToArray__WEBPACK_IMPORTED_MODULE_0__.default)(_useState, 2),\n forceUpdate = _useState2[1];\n\n var statesRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)([]);\n var destroyRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)(false);\n var walkingIndex = 0;\n var beforeFrameId = 0;\n (0,react__WEBPACK_IMPORTED_MODULE_1__.useEffect)(function () {\n return function () {\n destroyRef.current = true;\n };\n }, []);\n\n function createState(defaultValue) {\n var myIndex = walkingIndex;\n walkingIndex += 1; // Fill value if not exist yet\n\n if (statesRef.current.length < myIndex + 1) {\n statesRef.current[myIndex] = defaultValue;\n } // Return filled as `setState`\n\n\n var value = statesRef.current[myIndex];\n\n function setValue(val) {\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\n rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default.cancel(beforeFrameId); // Flush with batch\n\n beforeFrameId = (0,rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default)(function () {\n if (!destroyRef.current) {\n forceUpdate({});\n }\n });\n }\n\n return [value, setValue];\n }\n\n return createState;\n}","function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\n\t// _renderValidatedComponent) assume that calls to render aren't nested;\n\t// verify that that's the case. (This is called by each top-level update\n\t// function, like setProps, setState, forceUpdate, etc.; creation and\n\t// destruction of top-level components is guarded in ReactMount.)\n\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}","function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\n\t// _renderValidatedComponent) assume that calls to render aren't nested;\n\t// verify that that's the case. (This is called by each top-level update\n\t// function, like setProps, setState, forceUpdate, etc.; creation and\n\t// destruction of top-level components is guarded in ReactMount.)\n\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}","function batchedUpdates(callback) {\n if (isBatchingUpdates) {\n // We're already executing in an environment where updates will be batched,\n // so this is a no-op.\n callback();\n return;\n }\n\n isBatchingUpdates = true;\n\n try {\n callback();\n // TODO: Sort components by depth such that parent components update first\n for (var i = 0; i < dirtyComponents.length; i++) {\n // If a component is unmounted before pending changes apply, ignore them\n // TODO: Queue unmounts in the same list to avoid this happening at all\n var component = dirtyComponents[i];\n if (component.isMounted()) {\n // If performUpdateIfNecessary happens to enqueue any new updates, we\n // shouldn't execute the callbacks until the next render happens, so\n // stash the callbacks first\n var callbacks = component._pendingCallbacks;\n component._pendingCallbacks = null;\n component.performUpdateIfNecessary();\n if (callbacks) {\n for (var j = 0; j < callbacks.length; j++) {\n callbacks[j].call(component);\n }\n }\n }\n }\n } catch (error) {\n // IE8 requires `catch` in order to use `finally`.\n throw error;\n } finally {\n dirtyComponents.length = 0;\n isBatchingUpdates = false;\n }\n}","function createBatcher() {\n var queue = new Set();\n var add = function (child) { return queue.add(child); };\n var flush = function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, measureLayout = _b.measureLayout, layoutReady = _b.layoutReady, parent = _b.parent;\n var order = Array.from(queue).sort(sortByDepth);\n var resetAndMeasure = function () {\n /**\n * Write: Reset any transforms on children elements so we can read their actual layout\n */\n order.forEach(function (child) { return child.resetTransform(); });\n /**\n * Read: Measure the actual layout\n */\n order.forEach(measureLayout);\n };\n parent ? parent.withoutTransform(resetAndMeasure) : resetAndMeasure();\n /**\n * Write: Notify the VisualElements they're ready for further write operations.\n */\n order.forEach(layoutReady);\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n queue.clear();\n };\n return { add: add, flush: flush };\n}","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","onRowsRerender() {\n this.scheduleDraw(true);\n }","rerender(temp, temp2, renderChunkBorder) {\r\n this.resizeOffscreenCanvas()\r\n //this.ctx.drawImage(Chunk.texture, 0,0, this.image.width, this.image.height);\r\n this.objects.forEach(obj => {\r\n obj.render(this);\r\n }); \r\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","afterRender() { }","afterRender() { }","onBatchEnd() {\n this.logEventBatch(this.batchedEvents);\n const changeEvts = this.batchedEvents.filter((event) => event.isTreeChange);\n // TODO this is a bit spaghetti-ish, we should probably\n // have an event that fires and is listened to. This code shouldn't\n // know about the node tree.\n window.nodeTree.processTreeChanges(changeEvts);\n this.batchedEvents = [];\n }","updateMultiTexture() {\n\t\tthis.chunk.forEach(function(row, i, arr) {\n\t\t\trow.forEach(function(item, j, rarr) {\n\t\t\t\titem.updateMultiTexture();\n\t\t\t})\n\t\t});\n\t}","function useBatchFrameState() {\n var _useState = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useState\"])({}),\n _useState2 = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__babel_runtime_helpers_esm_slicedToArray__[\"a\" /* default */])(_useState, 2),\n forceUpdate = _useState2[1];\n\n var statesRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useRef\"])([]);\n var destroyRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useRef\"])(false);\n var walkingIndex = 0;\n var beforeFrameId = 0;\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useEffect\"])(function () {\n return function () {\n destroyRef.current = true;\n };\n }, []);\n\n function createState(defaultValue) {\n var myIndex = walkingIndex;\n walkingIndex += 1; // Fill value if not exist yet\n\n if (statesRef.current.length < myIndex + 1) {\n statesRef.current[myIndex] = defaultValue;\n } // Return filled as `setState`\n\n\n var value = statesRef.current[myIndex];\n\n function setValue(val) {\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\n __WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\"a\" /* default */].cancel(beforeFrameId); // Flush with batch\n\n beforeFrameId = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\"a\" /* default */])(function () {\n if (!destroyRef.current) {\n forceUpdate({});\n }\n });\n }\n\n return [value, setValue];\n }\n\n return createState;\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedCallback(callback) {\n\treturn function(err, res) {\n\t\tReactUpdates.batchedUpdates(callback.bind(null, err, res));\n\t}\n}","function batchRenderer(itemPromise, recycled) {\n var element, label, item, img;\n if (!recycled) {\n // create a basic template for the item which doesn't depend on the data\n element = document.createElement(\"div\");\n element.className = \"itemTempl\";\n element.innerHTML = \"<div class='content'>...</div>\";\n }\n else {\n // clean up the recycled element so that we can re-use it rather than having\n // to create the html from scratch\n element = recycled;\n label = element.querySelector(\".content\");\n label.innerHTML = \"...\";\n // remove the image if its arealy there\n img = element.querySelector(\"img\");\n if (img) { element.removeChild(img); }\n }\n // return the element as the placeholder, and a callback to update it when data is available\n return {\n element: element,\n // specifies a promise that will be completed when rendering is complete\n // itemPromise will complete when the data is available\n renderComplete: itemPromise.then(function (i) {\n item = i;\n // mutate the element to update only the title\n if (!label) { label = element.querySelector(\".content\"); }\n label.innerText = item.data.title;\n // use the item.ready promise to delay the more expensive work\n return item.ready;\n // use the ability to chain promises, to enable work to be cancelled\n }).then(function () {\n //use the image loader to queue the loading of the image\n return item.loadImage(item.data.thumbnail);\n }).then(thumbnailBatch()\n ).then(function (newimg) {\n img = newimg;\n element.insertBefore(img, element.firstElementChild);\n return item.isOnScreen();\n }).then(function (onscreen) {\n if (!onscreen) {\n //if the item is not visible, then don't animate its opacity\n img.style.opacity = 1;\n } else {\n //if the item is visible then animate the opacity of the image\n WinJS.UI.Animation.fadeIn(img);\n }\n }).then(null, function (err) {\n //if an error occurs, and its not a cancellation, then show a placeholder\n if (err.name === \"Canceled\") {\n return WinJS.Promise.wrapError(err);\n } else {\n img = element.querySelector(\"img\");\n if (img) {\n img.src = \"/images/placeholder-sdk.png\";\n img.style.opacity = 1;\n }\n return;\n }\n })\n };\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = !0;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates, isBatchingUpdates || isRendering || performWork(Sync$1, null);\n }\n }","renderInsidePatch() {\n\t\tif (this.component_.wasRendered && !this.shouldUpdate(this.changes_)) {\n\t\t\tthis.skipRerender_();\n\t\t\treturn;\n\t\t}\n\t\tthis.renderInsidePatchDontSkip_();\n\t}","_renderBuffers() {\n let buffers = this._bufferData;\n this._buffers.clearLayers();\n if (!buffers) return;\n\n buffers.features.forEach((feature) => {\n if (this._state[feature.properties.id]) {\n this._buffers.addData(feature);\n }\n }, this);\n }","function MultiRenderer()\n{\n this._views = [];\n}","function rerenderall() {\n console.log(\"Step 4\");\n rerenderElements(\"runs\");\n rerenderElements(\"configs\");\n rerenderElements(\"evals\");\n rerenderElements(\"locations\");\n}","flush() {\n this._renderer.flush();\n }","function enqueueUpdate(component) {\n\t\t ensureInjected();\n\t\t\n\t\t // Various parts of our code (such as ReactCompositeComponent's\n\t\t // _renderValidatedComponent) assume that calls to render aren't nested;\n\t\t // verify that that's the case. (This is called by each top-level update\n\t\t // function, like setState, forceUpdate, etc.; creation and\n\t\t // destruction of top-level components is guarded in ReactMount.)\n\t\t\n\t\t if (!batchingStrategy.isBatchingUpdates) {\n\t\t batchingStrategy.batchedUpdates(enqueueUpdate, component);\n\t\t return;\n\t\t }\n\t\t\n\t\t dirtyComponents.push(component);\n\t\t if (component._updateBatchNumber == null) {\n\t\t component._updateBatchNumber = updateBatchNumber + 1;\n\t\t }\n\t\t}"],"string":"[\n \"updateBatches() {\\n if (this.dirty === this.cacheDirty) {\\n return;\\n }\\n if (this.graphicsData.length === 0) {\\n return;\\n }\\n if (this.dirty !== this.cacheDirty) {\\n for (var i = 0; i < this.graphicsData.length; i++) {\\n var data = this.graphicsData[i];\\n // reveal(data.fillStyle.texture.baseTexture.resource);\\n // reveal(data.lineStyle.texture.baseTexture.resource);\\n if (data.fillStyle && !data.fillStyle.texture.baseTexture.valid) {\\n return;\\n }\\n if (data.lineStyle && !data.lineStyle.texture.baseTexture.valid) {\\n return;\\n }\\n }\\n }\\n this.cacheDirty = this.dirty;\\n var uvs = this.uvs;\\n var batchPart = this.batches.pop()\\n || GraphicsGeometry.BATCH_POOL.pop()\\n || new BatchPart();\\n batchPart.style = batchPart.style\\n || this.graphicsData[0].fillStyle\\n || this.graphicsData[0].lineStyle;\\n var currentTexture = batchPart.style.texture.baseTexture;\\n // reveal(currentTexture);\\n var currentColor = batchPart.style.color + batchPart.style.alpha;\\n this.batches.push(batchPart);\\n // reveal(this.batches);\\n // TODO - this can be simplified\\n for (var i$1 = this.shapeIndex; i$1 < this.graphicsData.length; i$1++) {\\n this.shapeIndex++;\\n var data$1 = this.graphicsData[i$1];\\n // reveal(data$1);\\n var command = GraphicsGeometry.getFillCommand(data$1.type);\\n // reveal(command)\\n var fillStyle = data$1.fillStyle;\\n var lineStyle = data$1.lineStyle;\\n // build out the shapes points..\\n command.build(data$1);\\n if (data$1.matrix) {\\n this.transformPoints(data$1.points, data$1.matrix);\\n // reveal(data$1.points)\\n // \\treveal(data$1.matrix)\\n }\\n for (var j = 0; j < 2; j++) {\\n var style = (j === 0) ? fillStyle : lineStyle;\\n if (!style.visible) {\\n continue;\\n }\\n var nextTexture = style.texture.baseTexture;\\n if (currentTexture !== nextTexture || (style.color + style.alpha) !== currentColor) {\\n // TODO use a const\\n nextTexture.wrapMode = 10497;\\n currentTexture = nextTexture;\\n currentColor = style.color + style.alpha;\\n var index$1 = this.indices.length;\\n var attribIndex = this.points.length / 2;\\n batchPart.size = index$1 - batchPart.start;\\n batchPart.attribSize = attribIndex - batchPart.attribStart;\\n if (batchPart.size > 0) {\\n batchPart = GraphicsGeometry.BATCH_POOL.pop() || new BatchPart();\\n this.batches.push(batchPart);\\n }\\n batchPart.style = style;\\n batchPart.start = index$1;\\n batchPart.attribStart = attribIndex;\\n // TODO add this to the render part..\\n }\\n var start = this.points.length / 2;\\n if (j === 0) {\\n if (data$1.holes.length) {\\n this.processHoles(data$1.holes);\\n GraphicsGeometry.buildPoly.triangulate(data$1, this);\\n }\\n else {\\n command.triangulate(data$1, this);\\n }\\n }\\n else {\\n GraphicsGeometry.buildLine(data$1, this);\\n for (var i$2 = 0; i$2 < data$1.holes.length; i$2++) {\\n GraphicsGeometry.buildLine(data$1.holes[i$2], this);\\n }\\n }\\n var size = (this.points.length / 2) - start;\\n this.addUvs(this.points, uvs, style.texture, start, size, style.matrix);\\n }\\n }\\n var index = this.indices.length;\\n var attrib = this.points.length / 2;\\n batchPart.size = index - batchPart.start;\\n batchPart.attribSize = attrib - batchPart.attribStart;\\n this.indicesUint16 = new Uint16Array(this.indices);\\n // TODO make this a const..\\n this.batchable = this.isBatchable();\\n if (this.batchable) {\\n this.batchDirty++;\\n this.uvsFloat32 = new Float32Array(this.uvs);\\n // offset the indices so that it works with the batcher...\\n for (var i$3 = 0; i$3 < this.batches.length; i$3++) {\\n var batch = this.batches[i$3];\\n for (var j$1 = 0; j$1 < batch.size; j$1++) {\\n var index$2 = batch.start + j$1;\\n this.indicesUint16[index$2] = this.indicesUint16[index$2] - batch.attribStart;\\n }\\n }\\n }\\n else {\\n this.buildDrawCalls();\\n }\\n }\",\n \"flush() {\\n // trace(\\\"BatchRender flush \\\" + this.currentSize)\\n if (this.currentSize === 0) {\\n return;\\n }\\n var gl = this.renderer.gl;\\n var MAX_TEXTURES = this.MAX_TEXTURES;\\n var buffer = this.getAttributeBuffer(this.currentSize);\\n // reveal(buffer);\\n var indexBuffer = this.getIndexBuffer(this.currentIndexSize);\\n // reveal(indexBuffer);\\n var elements = this.elements;\\n var groups = this.groups;\\n var float32View = buffer.float32View;\\n // reveal(float32View);\\n var uint32View = buffer.uint32View;\\n // reveal(uint32View);\\n var touch = this.renderer.textureGC.count;\\n var index = 0;\\n var indexCount = 0;\\n var nextTexture;\\n var currentTexture;\\n var groupCount = 0;\\n var textureCount = 0;\\n var currentGroup = groups[0];\\n // reveal(currentGroup);\\n var blendMode = -1; // premultiplyBlendMode[elements[0]._texture.baseTexture.premultiplyAlpha ? 0 : ][elements[0].blendMode];\\n currentGroup.textureCount = 0;\\n currentGroup.start = 0;\\n currentGroup.blend = blendMode;\\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\\n var i;\\n for (i = 0; i < this.currentIndex; ++i) {\\n // upload the sprite elements...\\n // they have all ready been calculated so we just need to push them into the buffer.\\n var sprite = elements[i];\\n elements[i] = null;\\n nextTexture = sprite._texture.baseTexture;\\n // reveal(nextTexture);\\n var spriteBlendMode = BlendModesSettings_1.BlendModesSettings.premultiplyBlendMode[nextTexture.premultiplyAlpha ? 1 : 0][sprite.blendMode];\\n if (blendMode !== spriteBlendMode) {\\n blendMode = spriteBlendMode;\\n // force the batch to break!\\n currentTexture = null;\\n textureCount = MAX_TEXTURES;\\n TICK++;\\n }\\n if (currentTexture !== nextTexture) {\\n currentTexture = nextTexture;\\n if (nextTexture._batchEnabled !== TICK) {\\n if (textureCount === MAX_TEXTURES) {\\n TICK++;\\n textureCount = 0;\\n currentGroup.size = indexCount - currentGroup.start;\\n currentGroup = groups[groupCount++];\\n currentGroup.textureCount = 0;\\n currentGroup.blend = blendMode;\\n currentGroup.start = indexCount;\\n }\\n nextTexture.touched = touch;\\n nextTexture._batchEnabled = TICK;\\n nextTexture._id = textureCount;\\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\\n // reveal(currentGroup);\\n // reveal(nextTexture);\\n textureCount++;\\n }\\n }\\n this.packGeometry(sprite, float32View, uint32View, indexBuffer, index, indexCount); // argb, nextTexture._id, float32View, uint32View, indexBuffer, index, indexCount);\\n // HERE \\n // push a graphics..\\n index += (sprite.vertexData.length / 2) * this.vertSize;\\n indexCount += sprite.indices.length;\\n }\\n BaseTexture_1.BaseTexture._globalBatch = TICK;\\n currentGroup.size = indexCount - currentGroup.start;\\n // this.indexBuffer.update();\\n if (!WebGLSettings_1.WebGLSettings.CAN_UPLOAD_SAME_BUFFER) {\\n // this is still needed for IOS performance..\\n // it really does not like uploading to the same buffer in a single frame!\\n if (this.vaoMax <= this.vertexCount) {\\n this.vaoMax++;\\n /* eslint-disable max-len */\\n this.vaos[this.vertexCount] = new BatchGeometry_1.BatchGeometry();\\n }\\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\\n // this.vertexBuffers[this.vertexCount].update(buffer.vertices, 0);\\n this.renderer.geometry.bind(this.vaos[this.vertexCount]);\\n this.renderer.geometry.updateBuffers();\\n this.vertexCount++;\\n }\\n else {\\n // lets use the faster option, always use buffer number 0\\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\\n // if (true)// this.spriteOnly)\\n // {\\n // this.vaos[this.vertexCount].indexBuffer = this.defualtSpriteIndexBuffer;\\n // this.vaos[this.vertexCount].buffers[1] = this.defualtSpriteIndexBuffer;\\n // }\\n // this.vaos[0].attributes.aColor.stride = 24\\n // this.vaos[0].attributes.aColor.start = 16\\n // NOT SET\\n // this.vaos[0].attributes.aTextureCoord.stride = 24\\n // this.vaos[0].attributes.aTextureCoord.start = 8\\n // NOT SET\\n // this.vaos[0].attributes.aVertexPosition.stride = 24\\n // NOT SET\\n this.renderer.geometry.updateBuffers();\\n // \\n }\\n // this.renderer.state.set(this.state);\\n var textureSystem = this.renderer.texture;\\n var stateSystem = this.renderer.state;\\n // e.log(groupCount);\\n // / render the groups..\\n // trace(\\\"groupcount: \\\" + groupCount)\\n // trace(\\\"BatchRenderer count: \\\" + groupCount)\\n for (i = 0; i < groupCount; i++) {\\n var group = groups[i];\\n var groupTextureCount = group.textureCount;\\n for (var j = 0; j < groupTextureCount; j++) {\\n // trace(\\\"possible textureSystem bind call (BathRenderer)\\\")\\n // trace(\\\"binding: \\\" + group.textures[j] + \\\" to \\\" + j)\\n textureSystem.bind(group.textures[j], j);\\n group.textures[j] = null;\\n }\\n // this.state.blendMode = group.blend;\\n // this.state.blend = true;\\n // this.renderer.state.setState(this.state);\\n // set the blend mode..\\n stateSystem.setBlendMode(group.blend);\\n gl.drawElements(group.type, group.size, gl.UNSIGNED_SHORT, group.start * 2);\\n }\\n // reset elements for the next flush\\n this.currentIndex = 0;\\n this.currentSize = 0;\\n this.currentIndexSize = 0;\\n }\",\n \"function RenderBatch() {\\n\\tthis.mRenderData = new Array();\\n\\t\\n\\tthis.mNeedSort = false;\\n\\tthis.mFrustrumCull = true;\\n}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\\n var ancestors = parent\\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\\n : [];\\n write(function () {\\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\\n },\\n };\\n}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\\n var ancestors = parent\\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\\n : [];\\n write(function () {\\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\\n },\\n };\\n}\",\n \"function enqueueUpdate(component){ensureInjected();// Various parts of our code (such as ReactCompositeComponent's\\n// _renderValidatedComponent) assume that calls to render aren't nested;\\n// verify that that's the case. (This is called by each top-level update\\n// function, like setState, forceUpdate, etc.; creation and\\n// destruction of top-level components is guarded in ReactMount.)\\nif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);if(component._updateBatchNumber==null){component._updateBatchNumber=updateBatchNumber+1;}}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n var order = Array.from(queue).sort(compareByDepth);\\n if (parent) {\\n withoutTreeTransform(parent, function () {\\n batchResetAndMeasure(order);\\n });\\n }\\n else {\\n batchResetAndMeasure(order);\\n }\\n /**\\n * Write: Notify the VisualElements they're ready for further write operations.\\n */\\n order.forEach(layoutReady);\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n flushSync.preRender();\\n flushSync.render();\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n sync.postRender(function () { return order.forEach(assignProjectionToSnapshot); });\\n queue.clear();\\n },\\n };\\n}\",\n \"function u(e) {\\n // Various parts of our code (such as ReactCompositeComponent's\\n // _renderValidatedComponent) assume that calls to render aren't nested;\\n // verify that that's the case. (This is called by each top-level update\\n // function, like setState, forceUpdate, etc.; creation and\\n // destruction of top-level components is guarded in ReactMount.)\\n if (r(), !C.isBatchingUpdates) return void C.batchedUpdates(u, e);\\n v.push(e), null == e._updateBatchNumber && (e._updateBatchNumber = y + 1);\\n }\",\n \"buildDrawCalls() {\\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\\n for (var i = 0; i < this.drawCalls.length; i++) {\\n this.drawCalls[i].textures.length = 0;\\n GraphicsGeometry.DRAW_CALL_POOL.push(this.drawCalls[i]);\\n }\\n this.drawCalls.length = 0;\\n var uvs = this.uvs;\\n var colors = this.colors;\\n var textureIds = this.textureIds;\\n var currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\\n currentGroup.textureCount = 0;\\n currentGroup.start = 0;\\n currentGroup.size = 0;\\n currentGroup.type = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n var textureCount = 0;\\n var currentTexture = null;\\n var textureId = 0;\\n var native = false;\\n var drawMode = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n var index = 0;\\n this.drawCalls.push(currentGroup);\\n // TODO - this can be simplified\\n for (var i$1 = 0; i$1 < this.batches.length; i$1++) {\\n var data = this.batches[i$1];\\n // TODO add some full on MAX_TEXTURE CODE..\\n var MAX_TEXTURES = 8;\\n var style = data.style;\\n var nextTexture = style.texture.baseTexture;\\n if (native !== style.native) {\\n native = style.native;\\n drawMode = native ? DrawModeSettings_1.DrawModeSettings.DRAW_MODES.LINES : DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n // force the batch to break!\\n currentTexture = null;\\n textureCount = MAX_TEXTURES;\\n TICK++;\\n }\\n if (currentTexture !== nextTexture) {\\n currentTexture = nextTexture;\\n if (nextTexture._batchEnabled !== TICK) {\\n if (textureCount === MAX_TEXTURES) {\\n TICK++;\\n textureCount = 0;\\n if (currentGroup.size > 0) {\\n currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\\n this.drawCalls.push(currentGroup);\\n }\\n currentGroup.start = index;\\n currentGroup.size = 0;\\n currentGroup.textureCount = 0;\\n currentGroup.type = drawMode;\\n }\\n // TODO add this to the render part..\\n nextTexture.touched = 1; // touch;\\n nextTexture._batchEnabled = TICK;\\n nextTexture._id = textureCount;\\n nextTexture.wrapMode = 10497;\\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\\n textureCount++;\\n }\\n }\\n currentGroup.size += data.size;\\n index += data.size;\\n textureId = nextTexture._id;\\n this.addColors(colors, style.color, style.alpha, data.attribSize);\\n this.addTextureIds(textureIds, textureId, data.attribSize);\\n }\\n BaseTexture_1.BaseTexture._globalBatch = TICK;\\n // upload..\\n // merge for now!\\n var verts = this.points;\\n // verts are 2 positions.. so we * by 3 as there are 6 properties.. then 4 cos its bytes\\n var glPoints = new ArrayBuffer(verts.length * 3 * 4);\\n var f32 = new Float32Array(glPoints);\\n var u32 = new Uint32Array(glPoints);\\n var p = 0;\\n for (var i$2 = 0; i$2 < verts.length / 2; i$2++) {\\n f32[p++] = verts[i$2 * 2];\\n f32[p++] = verts[(i$2 * 2) + 1];\\n f32[p++] = uvs[i$2 * 2];\\n f32[p++] = uvs[(i$2 * 2) + 1];\\n u32[p++] = colors[i$2];\\n f32[p++] = textureIds[i$2];\\n }\\n this._buffer.update(glPoints);\\n this._indexBuffer.update(this.indicesUint16);\\n }\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\r\\n globalState.inBatch++;\\r\\n}\",\n \"function batchedUpdates(fn, a) {\\n\\t var previousIsBatchingUpdates = isBatchingUpdates;\\n\\t isBatchingUpdates = true;\\n\\t try {\\n\\t return fn(a);\\n\\t } finally {\\n\\t isBatchingUpdates = previousIsBatchingUpdates;\\n\\t if (!isBatchingUpdates && !isRendering) {\\n\\t performWork(Sync, null);\\n\\t }\\n\\t }\\n\\t }\",\n \"function addToBatchCache() {\\n\\t\\t\\n\\t\\tTHREE.WebGLBatchCompiler.batchCache.push( new THREE.WebGLBatchCompiler.batchCacheObject( geometry, materials, mesh.webGLBatches, mesh.webGLIsTransparent ));\\n\\t}\",\n \"updateRenderers_() {\\n this.renderers = this.staticRenderers.concat(this.getDynamicRenderers()).sort(rendererPrioritySort);\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n }\\n finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n batchLayout(function (read, write) {\\n var order = Array.from(queue).sort(compareByDepth);\\n var ancestors = parent\\n ? collectProjectingAncestors(parent)\\n : [];\\n write(function () {\\n var allElements = __spreadArray(__spreadArray([], __read(ancestors)), __read(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n flushSync.preRender();\\n flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n es.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n flushLayout();\\n },\\n };\\n}\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function _startBatch() {\\n ++_batch;\\n }\",\n \"render(delta, spriteBatch) {}\",\n \"function useBatchFrameState() {\\n var _useState = (0,react__WEBPACK_IMPORTED_MODULE_1__.useState)({}),\\n _useState2 = (0,_babel_runtime_helpers_esm_slicedToArray__WEBPACK_IMPORTED_MODULE_0__.default)(_useState, 2),\\n forceUpdate = _useState2[1];\\n\\n var statesRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)([]);\\n var destroyRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)(false);\\n var walkingIndex = 0;\\n var beforeFrameId = 0;\\n (0,react__WEBPACK_IMPORTED_MODULE_1__.useEffect)(function () {\\n return function () {\\n destroyRef.current = true;\\n };\\n }, []);\\n\\n function createState(defaultValue) {\\n var myIndex = walkingIndex;\\n walkingIndex += 1; // Fill value if not exist yet\\n\\n if (statesRef.current.length < myIndex + 1) {\\n statesRef.current[myIndex] = defaultValue;\\n } // Return filled as `setState`\\n\\n\\n var value = statesRef.current[myIndex];\\n\\n function setValue(val) {\\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\\n rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default.cancel(beforeFrameId); // Flush with batch\\n\\n beforeFrameId = (0,rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default)(function () {\\n if (!destroyRef.current) {\\n forceUpdate({});\\n }\\n });\\n }\\n\\n return [value, setValue];\\n }\\n\\n return createState;\\n}\",\n \"function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\\n\\t// _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t// verify that that's the case. (This is called by each top-level update\\n\\t// function, like setProps, setState, forceUpdate, etc.; creation and\\n\\t// destruction of top-level components is guarded in ReactMount.)\\n\\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}\",\n \"function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\\n\\t// _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t// verify that that's the case. (This is called by each top-level update\\n\\t// function, like setProps, setState, forceUpdate, etc.; creation and\\n\\t// destruction of top-level components is guarded in ReactMount.)\\n\\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}\",\n \"function batchedUpdates(callback) {\\n if (isBatchingUpdates) {\\n // We're already executing in an environment where updates will be batched,\\n // so this is a no-op.\\n callback();\\n return;\\n }\\n\\n isBatchingUpdates = true;\\n\\n try {\\n callback();\\n // TODO: Sort components by depth such that parent components update first\\n for (var i = 0; i < dirtyComponents.length; i++) {\\n // If a component is unmounted before pending changes apply, ignore them\\n // TODO: Queue unmounts in the same list to avoid this happening at all\\n var component = dirtyComponents[i];\\n if (component.isMounted()) {\\n // If performUpdateIfNecessary happens to enqueue any new updates, we\\n // shouldn't execute the callbacks until the next render happens, so\\n // stash the callbacks first\\n var callbacks = component._pendingCallbacks;\\n component._pendingCallbacks = null;\\n component.performUpdateIfNecessary();\\n if (callbacks) {\\n for (var j = 0; j < callbacks.length; j++) {\\n callbacks[j].call(component);\\n }\\n }\\n }\\n }\\n } catch (error) {\\n // IE8 requires `catch` in order to use `finally`.\\n throw error;\\n } finally {\\n dirtyComponents.length = 0;\\n isBatchingUpdates = false;\\n }\\n}\",\n \"function createBatcher() {\\n var queue = new Set();\\n var add = function (child) { return queue.add(child); };\\n var flush = function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, measureLayout = _b.measureLayout, layoutReady = _b.layoutReady, parent = _b.parent;\\n var order = Array.from(queue).sort(sortByDepth);\\n var resetAndMeasure = function () {\\n /**\\n * Write: Reset any transforms on children elements so we can read their actual layout\\n */\\n order.forEach(function (child) { return child.resetTransform(); });\\n /**\\n * Read: Measure the actual layout\\n */\\n order.forEach(measureLayout);\\n };\\n parent ? parent.withoutTransform(resetAndMeasure) : resetAndMeasure();\\n /**\\n * Write: Notify the VisualElements they're ready for further write operations.\\n */\\n order.forEach(layoutReady);\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n queue.clear();\\n };\\n return { add: add, flush: flush };\\n}\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"onRowsRerender() {\\n this.scheduleDraw(true);\\n }\",\n \"rerender(temp, temp2, renderChunkBorder) {\\r\\n this.resizeOffscreenCanvas()\\r\\n //this.ctx.drawImage(Chunk.texture, 0,0, this.image.width, this.image.height);\\r\\n this.objects.forEach(obj => {\\r\\n obj.render(this);\\r\\n }); \\r\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"afterRender() { }\",\n \"afterRender() { }\",\n \"onBatchEnd() {\\n this.logEventBatch(this.batchedEvents);\\n const changeEvts = this.batchedEvents.filter((event) => event.isTreeChange);\\n // TODO this is a bit spaghetti-ish, we should probably\\n // have an event that fires and is listened to. This code shouldn't\\n // know about the node tree.\\n window.nodeTree.processTreeChanges(changeEvts);\\n this.batchedEvents = [];\\n }\",\n \"updateMultiTexture() {\\n\\t\\tthis.chunk.forEach(function(row, i, arr) {\\n\\t\\t\\trow.forEach(function(item, j, rarr) {\\n\\t\\t\\t\\titem.updateMultiTexture();\\n\\t\\t\\t})\\n\\t\\t});\\n\\t}\",\n \"function useBatchFrameState() {\\n var _useState = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useState\\\"])({}),\\n _useState2 = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__babel_runtime_helpers_esm_slicedToArray__[\\\"a\\\" /* default */])(_useState, 2),\\n forceUpdate = _useState2[1];\\n\\n var statesRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useRef\\\"])([]);\\n var destroyRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useRef\\\"])(false);\\n var walkingIndex = 0;\\n var beforeFrameId = 0;\\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useEffect\\\"])(function () {\\n return function () {\\n destroyRef.current = true;\\n };\\n }, []);\\n\\n function createState(defaultValue) {\\n var myIndex = walkingIndex;\\n walkingIndex += 1; // Fill value if not exist yet\\n\\n if (statesRef.current.length < myIndex + 1) {\\n statesRef.current[myIndex] = defaultValue;\\n } // Return filled as `setState`\\n\\n\\n var value = statesRef.current[myIndex];\\n\\n function setValue(val) {\\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\\n __WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\\\"a\\\" /* default */].cancel(beforeFrameId); // Flush with batch\\n\\n beforeFrameId = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\\\"a\\\" /* default */])(function () {\\n if (!destroyRef.current) {\\n forceUpdate({});\\n }\\n });\\n }\\n\\n return [value, setValue];\\n }\\n\\n return createState;\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedCallback(callback) {\\n\\treturn function(err, res) {\\n\\t\\tReactUpdates.batchedUpdates(callback.bind(null, err, res));\\n\\t}\\n}\",\n \"function batchRenderer(itemPromise, recycled) {\\n var element, label, item, img;\\n if (!recycled) {\\n // create a basic template for the item which doesn't depend on the data\\n element = document.createElement(\\\"div\\\");\\n element.className = \\\"itemTempl\\\";\\n element.innerHTML = \\\"<div class='content'>...</div>\\\";\\n }\\n else {\\n // clean up the recycled element so that we can re-use it rather than having\\n // to create the html from scratch\\n element = recycled;\\n label = element.querySelector(\\\".content\\\");\\n label.innerHTML = \\\"...\\\";\\n // remove the image if its arealy there\\n img = element.querySelector(\\\"img\\\");\\n if (img) { element.removeChild(img); }\\n }\\n // return the element as the placeholder, and a callback to update it when data is available\\n return {\\n element: element,\\n // specifies a promise that will be completed when rendering is complete\\n // itemPromise will complete when the data is available\\n renderComplete: itemPromise.then(function (i) {\\n item = i;\\n // mutate the element to update only the title\\n if (!label) { label = element.querySelector(\\\".content\\\"); }\\n label.innerText = item.data.title;\\n // use the item.ready promise to delay the more expensive work\\n return item.ready;\\n // use the ability to chain promises, to enable work to be cancelled\\n }).then(function () {\\n //use the image loader to queue the loading of the image\\n return item.loadImage(item.data.thumbnail);\\n }).then(thumbnailBatch()\\n ).then(function (newimg) {\\n img = newimg;\\n element.insertBefore(img, element.firstElementChild);\\n return item.isOnScreen();\\n }).then(function (onscreen) {\\n if (!onscreen) {\\n //if the item is not visible, then don't animate its opacity\\n img.style.opacity = 1;\\n } else {\\n //if the item is visible then animate the opacity of the image\\n WinJS.UI.Animation.fadeIn(img);\\n }\\n }).then(null, function (err) {\\n //if an error occurs, and its not a cancellation, then show a placeholder\\n if (err.name === \\\"Canceled\\\") {\\n return WinJS.Promise.wrapError(err);\\n } else {\\n img = element.querySelector(\\\"img\\\");\\n if (img) {\\n img.src = \\\"/images/placeholder-sdk.png\\\";\\n img.style.opacity = 1;\\n }\\n return;\\n }\\n })\\n };\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = !0;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates, isBatchingUpdates || isRendering || performWork(Sync$1, null);\\n }\\n }\",\n \"renderInsidePatch() {\\n\\t\\tif (this.component_.wasRendered && !this.shouldUpdate(this.changes_)) {\\n\\t\\t\\tthis.skipRerender_();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tthis.renderInsidePatchDontSkip_();\\n\\t}\",\n \"_renderBuffers() {\\n let buffers = this._bufferData;\\n this._buffers.clearLayers();\\n if (!buffers) return;\\n\\n buffers.features.forEach((feature) => {\\n if (this._state[feature.properties.id]) {\\n this._buffers.addData(feature);\\n }\\n }, this);\\n }\",\n \"function MultiRenderer()\\n{\\n this._views = [];\\n}\",\n \"function rerenderall() {\\n console.log(\\\"Step 4\\\");\\n rerenderElements(\\\"runs\\\");\\n rerenderElements(\\\"configs\\\");\\n rerenderElements(\\\"evals\\\");\\n rerenderElements(\\\"locations\\\");\\n}\",\n \"flush() {\\n this._renderer.flush();\\n }\",\n \"function enqueueUpdate(component) {\\n\\t\\t ensureInjected();\\n\\t\\t\\n\\t\\t // Various parts of our code (such as ReactCompositeComponent's\\n\\t\\t // _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t\\t // verify that that's the case. (This is called by each top-level update\\n\\t\\t // function, like setState, forceUpdate, etc.; creation and\\n\\t\\t // destruction of top-level components is guarded in ReactMount.)\\n\\t\\t\\n\\t\\t if (!batchingStrategy.isBatchingUpdates) {\\n\\t\\t batchingStrategy.batchedUpdates(enqueueUpdate, component);\\n\\t\\t return;\\n\\t\\t }\\n\\t\\t\\n\\t\\t dirtyComponents.push(component);\\n\\t\\t if (component._updateBatchNumber == null) {\\n\\t\\t component._updateBatchNumber = updateBatchNumber + 1;\\n\\t\\t }\\n\\t\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.66131675","0.6574288","0.65535474","0.65384126","0.65384126","0.6136533","0.6087616","0.6049396","0.6025469","0.5977921","0.5929122","0.5929122","0.5929122","0.5929122","0.5929122","0.5929122","0.5929122","0.5929122","0.5929122","0.588165","0.5860314","0.5831162","0.581113","0.5810291","0.58005863","0.57984257","0.57984257","0.57756394","0.57652855","0.5758374","0.575152","0.575152","0.5743155","0.57431537","0.57425046","0.57425046","0.57425046","0.57425046","0.57425046","0.57425046","0.57425046","0.57425046","0.57425046","0.57425046","0.57425046","0.57425046","0.5718858","0.56974345","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5658714","0.5639124","0.5639124","0.56328046","0.5617623","0.56153226","0.5600949","0.55936646","0.5588238","0.5572006","0.5567559","0.55630404","0.5553793","0.5550429","0.5537467","0.55106074"],"string":"[\n \"0.66131675\",\n \"0.6574288\",\n \"0.65535474\",\n \"0.65384126\",\n \"0.65384126\",\n \"0.6136533\",\n \"0.6087616\",\n \"0.6049396\",\n \"0.6025469\",\n \"0.5977921\",\n \"0.5929122\",\n \"0.5929122\",\n \"0.5929122\",\n \"0.5929122\",\n \"0.5929122\",\n \"0.5929122\",\n \"0.5929122\",\n \"0.5929122\",\n \"0.5929122\",\n \"0.588165\",\n \"0.5860314\",\n \"0.5831162\",\n \"0.581113\",\n \"0.5810291\",\n \"0.58005863\",\n \"0.57984257\",\n \"0.57984257\",\n \"0.57756394\",\n \"0.57652855\",\n \"0.5758374\",\n \"0.575152\",\n \"0.575152\",\n \"0.5743155\",\n \"0.57431537\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.57425046\",\n \"0.5718858\",\n \"0.56974345\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5658714\",\n \"0.5639124\",\n \"0.5639124\",\n \"0.56328046\",\n \"0.5617623\",\n \"0.56153226\",\n \"0.5600949\",\n \"0.55936646\",\n \"0.5588238\",\n \"0.5572006\",\n \"0.5567559\",\n \"0.55630404\",\n \"0.5553793\",\n \"0.5550429\",\n \"0.5537467\",\n \"0.55106074\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5794,"cells":{"query":{"kind":"string","value":"TODO: Batching should be implemented at the renderer level, not inside the reconciler."},"document":{"kind":"string","value":"function unbatchedUpdates(fn, a) {\n if (isBatchingUpdates && !isUnbatchingUpdates) {\n isUnbatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isUnbatchingUpdates = false;\n }\n }\n return fn(a);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["updateBatches() {\n if (this.dirty === this.cacheDirty) {\n return;\n }\n if (this.graphicsData.length === 0) {\n return;\n }\n if (this.dirty !== this.cacheDirty) {\n for (var i = 0; i < this.graphicsData.length; i++) {\n var data = this.graphicsData[i];\n // reveal(data.fillStyle.texture.baseTexture.resource);\n // reveal(data.lineStyle.texture.baseTexture.resource);\n if (data.fillStyle && !data.fillStyle.texture.baseTexture.valid) {\n return;\n }\n if (data.lineStyle && !data.lineStyle.texture.baseTexture.valid) {\n return;\n }\n }\n }\n this.cacheDirty = this.dirty;\n var uvs = this.uvs;\n var batchPart = this.batches.pop()\n || GraphicsGeometry.BATCH_POOL.pop()\n || new BatchPart();\n batchPart.style = batchPart.style\n || this.graphicsData[0].fillStyle\n || this.graphicsData[0].lineStyle;\n var currentTexture = batchPart.style.texture.baseTexture;\n // reveal(currentTexture);\n var currentColor = batchPart.style.color + batchPart.style.alpha;\n this.batches.push(batchPart);\n // reveal(this.batches);\n // TODO - this can be simplified\n for (var i$1 = this.shapeIndex; i$1 < this.graphicsData.length; i$1++) {\n this.shapeIndex++;\n var data$1 = this.graphicsData[i$1];\n // reveal(data$1);\n var command = GraphicsGeometry.getFillCommand(data$1.type);\n // reveal(command)\n var fillStyle = data$1.fillStyle;\n var lineStyle = data$1.lineStyle;\n // build out the shapes points..\n command.build(data$1);\n if (data$1.matrix) {\n this.transformPoints(data$1.points, data$1.matrix);\n // reveal(data$1.points)\n // \treveal(data$1.matrix)\n }\n for (var j = 0; j < 2; j++) {\n var style = (j === 0) ? fillStyle : lineStyle;\n if (!style.visible) {\n continue;\n }\n var nextTexture = style.texture.baseTexture;\n if (currentTexture !== nextTexture || (style.color + style.alpha) !== currentColor) {\n // TODO use a const\n nextTexture.wrapMode = 10497;\n currentTexture = nextTexture;\n currentColor = style.color + style.alpha;\n var index$1 = this.indices.length;\n var attribIndex = this.points.length / 2;\n batchPart.size = index$1 - batchPart.start;\n batchPart.attribSize = attribIndex - batchPart.attribStart;\n if (batchPart.size > 0) {\n batchPart = GraphicsGeometry.BATCH_POOL.pop() || new BatchPart();\n this.batches.push(batchPart);\n }\n batchPart.style = style;\n batchPart.start = index$1;\n batchPart.attribStart = attribIndex;\n // TODO add this to the render part..\n }\n var start = this.points.length / 2;\n if (j === 0) {\n if (data$1.holes.length) {\n this.processHoles(data$1.holes);\n GraphicsGeometry.buildPoly.triangulate(data$1, this);\n }\n else {\n command.triangulate(data$1, this);\n }\n }\n else {\n GraphicsGeometry.buildLine(data$1, this);\n for (var i$2 = 0; i$2 < data$1.holes.length; i$2++) {\n GraphicsGeometry.buildLine(data$1.holes[i$2], this);\n }\n }\n var size = (this.points.length / 2) - start;\n this.addUvs(this.points, uvs, style.texture, start, size, style.matrix);\n }\n }\n var index = this.indices.length;\n var attrib = this.points.length / 2;\n batchPart.size = index - batchPart.start;\n batchPart.attribSize = attrib - batchPart.attribStart;\n this.indicesUint16 = new Uint16Array(this.indices);\n // TODO make this a const..\n this.batchable = this.isBatchable();\n if (this.batchable) {\n this.batchDirty++;\n this.uvsFloat32 = new Float32Array(this.uvs);\n // offset the indices so that it works with the batcher...\n for (var i$3 = 0; i$3 < this.batches.length; i$3++) {\n var batch = this.batches[i$3];\n for (var j$1 = 0; j$1 < batch.size; j$1++) {\n var index$2 = batch.start + j$1;\n this.indicesUint16[index$2] = this.indicesUint16[index$2] - batch.attribStart;\n }\n }\n }\n else {\n this.buildDrawCalls();\n }\n }","flush() {\n // trace(\"BatchRender flush \" + this.currentSize)\n if (this.currentSize === 0) {\n return;\n }\n var gl = this.renderer.gl;\n var MAX_TEXTURES = this.MAX_TEXTURES;\n var buffer = this.getAttributeBuffer(this.currentSize);\n // reveal(buffer);\n var indexBuffer = this.getIndexBuffer(this.currentIndexSize);\n // reveal(indexBuffer);\n var elements = this.elements;\n var groups = this.groups;\n var float32View = buffer.float32View;\n // reveal(float32View);\n var uint32View = buffer.uint32View;\n // reveal(uint32View);\n var touch = this.renderer.textureGC.count;\n var index = 0;\n var indexCount = 0;\n var nextTexture;\n var currentTexture;\n var groupCount = 0;\n var textureCount = 0;\n var currentGroup = groups[0];\n // reveal(currentGroup);\n var blendMode = -1; // premultiplyBlendMode[elements[0]._texture.baseTexture.premultiplyAlpha ? 0 : ][elements[0].blendMode];\n currentGroup.textureCount = 0;\n currentGroup.start = 0;\n currentGroup.blend = blendMode;\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\n var i;\n for (i = 0; i < this.currentIndex; ++i) {\n // upload the sprite elements...\n // they have all ready been calculated so we just need to push them into the buffer.\n var sprite = elements[i];\n elements[i] = null;\n nextTexture = sprite._texture.baseTexture;\n // reveal(nextTexture);\n var spriteBlendMode = BlendModesSettings_1.BlendModesSettings.premultiplyBlendMode[nextTexture.premultiplyAlpha ? 1 : 0][sprite.blendMode];\n if (blendMode !== spriteBlendMode) {\n blendMode = spriteBlendMode;\n // force the batch to break!\n currentTexture = null;\n textureCount = MAX_TEXTURES;\n TICK++;\n }\n if (currentTexture !== nextTexture) {\n currentTexture = nextTexture;\n if (nextTexture._batchEnabled !== TICK) {\n if (textureCount === MAX_TEXTURES) {\n TICK++;\n textureCount = 0;\n currentGroup.size = indexCount - currentGroup.start;\n currentGroup = groups[groupCount++];\n currentGroup.textureCount = 0;\n currentGroup.blend = blendMode;\n currentGroup.start = indexCount;\n }\n nextTexture.touched = touch;\n nextTexture._batchEnabled = TICK;\n nextTexture._id = textureCount;\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\n // reveal(currentGroup);\n // reveal(nextTexture);\n textureCount++;\n }\n }\n this.packGeometry(sprite, float32View, uint32View, indexBuffer, index, indexCount); // argb, nextTexture._id, float32View, uint32View, indexBuffer, index, indexCount);\n // HERE \n // push a graphics..\n index += (sprite.vertexData.length / 2) * this.vertSize;\n indexCount += sprite.indices.length;\n }\n BaseTexture_1.BaseTexture._globalBatch = TICK;\n currentGroup.size = indexCount - currentGroup.start;\n // this.indexBuffer.update();\n if (!WebGLSettings_1.WebGLSettings.CAN_UPLOAD_SAME_BUFFER) {\n // this is still needed for IOS performance..\n // it really does not like uploading to the same buffer in a single frame!\n if (this.vaoMax <= this.vertexCount) {\n this.vaoMax++;\n /* eslint-disable max-len */\n this.vaos[this.vertexCount] = new BatchGeometry_1.BatchGeometry();\n }\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\n // this.vertexBuffers[this.vertexCount].update(buffer.vertices, 0);\n this.renderer.geometry.bind(this.vaos[this.vertexCount]);\n this.renderer.geometry.updateBuffers();\n this.vertexCount++;\n }\n else {\n // lets use the faster option, always use buffer number 0\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\n // if (true)// this.spriteOnly)\n // {\n // this.vaos[this.vertexCount].indexBuffer = this.defualtSpriteIndexBuffer;\n // this.vaos[this.vertexCount].buffers[1] = this.defualtSpriteIndexBuffer;\n // }\n // this.vaos[0].attributes.aColor.stride = 24\n // this.vaos[0].attributes.aColor.start = 16\n // NOT SET\n // this.vaos[0].attributes.aTextureCoord.stride = 24\n // this.vaos[0].attributes.aTextureCoord.start = 8\n // NOT SET\n // this.vaos[0].attributes.aVertexPosition.stride = 24\n // NOT SET\n this.renderer.geometry.updateBuffers();\n // \n }\n // this.renderer.state.set(this.state);\n var textureSystem = this.renderer.texture;\n var stateSystem = this.renderer.state;\n // e.log(groupCount);\n // / render the groups..\n // trace(\"groupcount: \" + groupCount)\n // trace(\"BatchRenderer count: \" + groupCount)\n for (i = 0; i < groupCount; i++) {\n var group = groups[i];\n var groupTextureCount = group.textureCount;\n for (var j = 0; j < groupTextureCount; j++) {\n // trace(\"possible textureSystem bind call (BathRenderer)\")\n // trace(\"binding: \" + group.textures[j] + \" to \" + j)\n textureSystem.bind(group.textures[j], j);\n group.textures[j] = null;\n }\n // this.state.blendMode = group.blend;\n // this.state.blend = true;\n // this.renderer.state.setState(this.state);\n // set the blend mode..\n stateSystem.setBlendMode(group.blend);\n gl.drawElements(group.type, group.size, gl.UNSIGNED_SHORT, group.start * 2);\n }\n // reset elements for the next flush\n this.currentIndex = 0;\n this.currentSize = 0;\n this.currentIndexSize = 0;\n }","function RenderBatch() {\n\tthis.mRenderData = new Array();\n\t\n\tthis.mNeedSort = false;\n\tthis.mFrustrumCull = true;\n}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\n var ancestors = parent\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\n : [];\n write(function () {\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\n },\n };\n}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\n var ancestors = parent\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\n : [];\n write(function () {\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\n },\n };\n}","function enqueueUpdate(component){ensureInjected();// Various parts of our code (such as ReactCompositeComponent's\n// _renderValidatedComponent) assume that calls to render aren't nested;\n// verify that that's the case. (This is called by each top-level update\n// function, like setState, forceUpdate, etc.; creation and\n// destruction of top-level components is guarded in ReactMount.)\nif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);if(component._updateBatchNumber==null){component._updateBatchNumber=updateBatchNumber+1;}}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n var order = Array.from(queue).sort(compareByDepth);\n if (parent) {\n withoutTreeTransform(parent, function () {\n batchResetAndMeasure(order);\n });\n }\n else {\n batchResetAndMeasure(order);\n }\n /**\n * Write: Notify the VisualElements they're ready for further write operations.\n */\n order.forEach(layoutReady);\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n flushSync.preRender();\n flushSync.render();\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n sync.postRender(function () { return order.forEach(assignProjectionToSnapshot); });\n queue.clear();\n },\n };\n}","function u(e) {\n // Various parts of our code (such as ReactCompositeComponent's\n // _renderValidatedComponent) assume that calls to render aren't nested;\n // verify that that's the case. (This is called by each top-level update\n // function, like setState, forceUpdate, etc.; creation and\n // destruction of top-level components is guarded in ReactMount.)\n if (r(), !C.isBatchingUpdates) return void C.batchedUpdates(u, e);\n v.push(e), null == e._updateBatchNumber && (e._updateBatchNumber = y + 1);\n }","buildDrawCalls() {\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\n for (var i = 0; i < this.drawCalls.length; i++) {\n this.drawCalls[i].textures.length = 0;\n GraphicsGeometry.DRAW_CALL_POOL.push(this.drawCalls[i]);\n }\n this.drawCalls.length = 0;\n var uvs = this.uvs;\n var colors = this.colors;\n var textureIds = this.textureIds;\n var currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\n currentGroup.textureCount = 0;\n currentGroup.start = 0;\n currentGroup.size = 0;\n currentGroup.type = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n var textureCount = 0;\n var currentTexture = null;\n var textureId = 0;\n var native = false;\n var drawMode = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n var index = 0;\n this.drawCalls.push(currentGroup);\n // TODO - this can be simplified\n for (var i$1 = 0; i$1 < this.batches.length; i$1++) {\n var data = this.batches[i$1];\n // TODO add some full on MAX_TEXTURE CODE..\n var MAX_TEXTURES = 8;\n var style = data.style;\n var nextTexture = style.texture.baseTexture;\n if (native !== style.native) {\n native = style.native;\n drawMode = native ? DrawModeSettings_1.DrawModeSettings.DRAW_MODES.LINES : DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n // force the batch to break!\n currentTexture = null;\n textureCount = MAX_TEXTURES;\n TICK++;\n }\n if (currentTexture !== nextTexture) {\n currentTexture = nextTexture;\n if (nextTexture._batchEnabled !== TICK) {\n if (textureCount === MAX_TEXTURES) {\n TICK++;\n textureCount = 0;\n if (currentGroup.size > 0) {\n currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\n this.drawCalls.push(currentGroup);\n }\n currentGroup.start = index;\n currentGroup.size = 0;\n currentGroup.textureCount = 0;\n currentGroup.type = drawMode;\n }\n // TODO add this to the render part..\n nextTexture.touched = 1; // touch;\n nextTexture._batchEnabled = TICK;\n nextTexture._id = textureCount;\n nextTexture.wrapMode = 10497;\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\n textureCount++;\n }\n }\n currentGroup.size += data.size;\n index += data.size;\n textureId = nextTexture._id;\n this.addColors(colors, style.color, style.alpha, data.attribSize);\n this.addTextureIds(textureIds, textureId, data.attribSize);\n }\n BaseTexture_1.BaseTexture._globalBatch = TICK;\n // upload..\n // merge for now!\n var verts = this.points;\n // verts are 2 positions.. so we * by 3 as there are 6 properties.. then 4 cos its bytes\n var glPoints = new ArrayBuffer(verts.length * 3 * 4);\n var f32 = new Float32Array(glPoints);\n var u32 = new Uint32Array(glPoints);\n var p = 0;\n for (var i$2 = 0; i$2 < verts.length / 2; i$2++) {\n f32[p++] = verts[i$2 * 2];\n f32[p++] = verts[(i$2 * 2) + 1];\n f32[p++] = uvs[i$2 * 2];\n f32[p++] = uvs[(i$2 * 2) + 1];\n u32[p++] = colors[i$2];\n f32[p++] = textureIds[i$2];\n }\n this._buffer.update(glPoints);\n this._indexBuffer.update(this.indicesUint16);\n }","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\r\n globalState.inBatch++;\r\n}","function batchedUpdates(fn, a) {\n\t var previousIsBatchingUpdates = isBatchingUpdates;\n\t isBatchingUpdates = true;\n\t try {\n\t return fn(a);\n\t } finally {\n\t isBatchingUpdates = previousIsBatchingUpdates;\n\t if (!isBatchingUpdates && !isRendering) {\n\t performWork(Sync, null);\n\t }\n\t }\n\t }","function addToBatchCache() {\n\t\t\n\t\tTHREE.WebGLBatchCompiler.batchCache.push( new THREE.WebGLBatchCompiler.batchCacheObject( geometry, materials, mesh.webGLBatches, mesh.webGLIsTransparent ));\n\t}","updateRenderers_() {\n this.renderers = this.staticRenderers.concat(this.getDynamicRenderers()).sort(rendererPrioritySort);\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n }\n finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n batchLayout(function (read, write) {\n var order = Array.from(queue).sort(compareByDepth);\n var ancestors = parent\n ? collectProjectingAncestors(parent)\n : [];\n write(function () {\n var allElements = __spreadArray(__spreadArray([], __read(ancestors)), __read(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n flushSync.preRender();\n flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n es.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n flushLayout();\n },\n };\n}","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function _startBatch() {\n ++_batch;\n }","render(delta, spriteBatch) {}","function useBatchFrameState() {\n var _useState = (0,react__WEBPACK_IMPORTED_MODULE_1__.useState)({}),\n _useState2 = (0,_babel_runtime_helpers_esm_slicedToArray__WEBPACK_IMPORTED_MODULE_0__.default)(_useState, 2),\n forceUpdate = _useState2[1];\n\n var statesRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)([]);\n var destroyRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)(false);\n var walkingIndex = 0;\n var beforeFrameId = 0;\n (0,react__WEBPACK_IMPORTED_MODULE_1__.useEffect)(function () {\n return function () {\n destroyRef.current = true;\n };\n }, []);\n\n function createState(defaultValue) {\n var myIndex = walkingIndex;\n walkingIndex += 1; // Fill value if not exist yet\n\n if (statesRef.current.length < myIndex + 1) {\n statesRef.current[myIndex] = defaultValue;\n } // Return filled as `setState`\n\n\n var value = statesRef.current[myIndex];\n\n function setValue(val) {\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\n rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default.cancel(beforeFrameId); // Flush with batch\n\n beforeFrameId = (0,rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default)(function () {\n if (!destroyRef.current) {\n forceUpdate({});\n }\n });\n }\n\n return [value, setValue];\n }\n\n return createState;\n}","function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\n\t// _renderValidatedComponent) assume that calls to render aren't nested;\n\t// verify that that's the case. (This is called by each top-level update\n\t// function, like setProps, setState, forceUpdate, etc.; creation and\n\t// destruction of top-level components is guarded in ReactMount.)\n\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}","function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\n\t// _renderValidatedComponent) assume that calls to render aren't nested;\n\t// verify that that's the case. (This is called by each top-level update\n\t// function, like setProps, setState, forceUpdate, etc.; creation and\n\t// destruction of top-level components is guarded in ReactMount.)\n\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}","function createBatcher() {\n var queue = new Set();\n var add = function (child) { return queue.add(child); };\n var flush = function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, measureLayout = _b.measureLayout, layoutReady = _b.layoutReady, parent = _b.parent;\n var order = Array.from(queue).sort(sortByDepth);\n var resetAndMeasure = function () {\n /**\n * Write: Reset any transforms on children elements so we can read their actual layout\n */\n order.forEach(function (child) { return child.resetTransform(); });\n /**\n * Read: Measure the actual layout\n */\n order.forEach(measureLayout);\n };\n parent ? parent.withoutTransform(resetAndMeasure) : resetAndMeasure();\n /**\n * Write: Notify the VisualElements they're ready for further write operations.\n */\n order.forEach(layoutReady);\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n queue.clear();\n };\n return { add: add, flush: flush };\n}","function batchedUpdates(callback) {\n if (isBatchingUpdates) {\n // We're already executing in an environment where updates will be batched,\n // so this is a no-op.\n callback();\n return;\n }\n\n isBatchingUpdates = true;\n\n try {\n callback();\n // TODO: Sort components by depth such that parent components update first\n for (var i = 0; i < dirtyComponents.length; i++) {\n // If a component is unmounted before pending changes apply, ignore them\n // TODO: Queue unmounts in the same list to avoid this happening at all\n var component = dirtyComponents[i];\n if (component.isMounted()) {\n // If performUpdateIfNecessary happens to enqueue any new updates, we\n // shouldn't execute the callbacks until the next render happens, so\n // stash the callbacks first\n var callbacks = component._pendingCallbacks;\n component._pendingCallbacks = null;\n component.performUpdateIfNecessary();\n if (callbacks) {\n for (var j = 0; j < callbacks.length; j++) {\n callbacks[j].call(component);\n }\n }\n }\n }\n } catch (error) {\n // IE8 requires `catch` in order to use `finally`.\n throw error;\n } finally {\n dirtyComponents.length = 0;\n isBatchingUpdates = false;\n }\n}","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","onRowsRerender() {\n this.scheduleDraw(true);\n }","rerender(temp, temp2, renderChunkBorder) {\r\n this.resizeOffscreenCanvas()\r\n //this.ctx.drawImage(Chunk.texture, 0,0, this.image.width, this.image.height);\r\n this.objects.forEach(obj => {\r\n obj.render(this);\r\n }); \r\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","afterRender() { }","afterRender() { }","onBatchEnd() {\n this.logEventBatch(this.batchedEvents);\n const changeEvts = this.batchedEvents.filter((event) => event.isTreeChange);\n // TODO this is a bit spaghetti-ish, we should probably\n // have an event that fires and is listened to. This code shouldn't\n // know about the node tree.\n window.nodeTree.processTreeChanges(changeEvts);\n this.batchedEvents = [];\n }","updateMultiTexture() {\n\t\tthis.chunk.forEach(function(row, i, arr) {\n\t\t\trow.forEach(function(item, j, rarr) {\n\t\t\t\titem.updateMultiTexture();\n\t\t\t})\n\t\t});\n\t}","function useBatchFrameState() {\n var _useState = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useState\"])({}),\n _useState2 = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__babel_runtime_helpers_esm_slicedToArray__[\"a\" /* default */])(_useState, 2),\n forceUpdate = _useState2[1];\n\n var statesRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useRef\"])([]);\n var destroyRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useRef\"])(false);\n var walkingIndex = 0;\n var beforeFrameId = 0;\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useEffect\"])(function () {\n return function () {\n destroyRef.current = true;\n };\n }, []);\n\n function createState(defaultValue) {\n var myIndex = walkingIndex;\n walkingIndex += 1; // Fill value if not exist yet\n\n if (statesRef.current.length < myIndex + 1) {\n statesRef.current[myIndex] = defaultValue;\n } // Return filled as `setState`\n\n\n var value = statesRef.current[myIndex];\n\n function setValue(val) {\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\n __WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\"a\" /* default */].cancel(beforeFrameId); // Flush with batch\n\n beforeFrameId = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\"a\" /* default */])(function () {\n if (!destroyRef.current) {\n forceUpdate({});\n }\n });\n }\n\n return [value, setValue];\n }\n\n return createState;\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedCallback(callback) {\n\treturn function(err, res) {\n\t\tReactUpdates.batchedUpdates(callback.bind(null, err, res));\n\t}\n}","function batchRenderer(itemPromise, recycled) {\n var element, label, item, img;\n if (!recycled) {\n // create a basic template for the item which doesn't depend on the data\n element = document.createElement(\"div\");\n element.className = \"itemTempl\";\n element.innerHTML = \"<div class='content'>...</div>\";\n }\n else {\n // clean up the recycled element so that we can re-use it rather than having\n // to create the html from scratch\n element = recycled;\n label = element.querySelector(\".content\");\n label.innerHTML = \"...\";\n // remove the image if its arealy there\n img = element.querySelector(\"img\");\n if (img) { element.removeChild(img); }\n }\n // return the element as the placeholder, and a callback to update it when data is available\n return {\n element: element,\n // specifies a promise that will be completed when rendering is complete\n // itemPromise will complete when the data is available\n renderComplete: itemPromise.then(function (i) {\n item = i;\n // mutate the element to update only the title\n if (!label) { label = element.querySelector(\".content\"); }\n label.innerText = item.data.title;\n // use the item.ready promise to delay the more expensive work\n return item.ready;\n // use the ability to chain promises, to enable work to be cancelled\n }).then(function () {\n //use the image loader to queue the loading of the image\n return item.loadImage(item.data.thumbnail);\n }).then(thumbnailBatch()\n ).then(function (newimg) {\n img = newimg;\n element.insertBefore(img, element.firstElementChild);\n return item.isOnScreen();\n }).then(function (onscreen) {\n if (!onscreen) {\n //if the item is not visible, then don't animate its opacity\n img.style.opacity = 1;\n } else {\n //if the item is visible then animate the opacity of the image\n WinJS.UI.Animation.fadeIn(img);\n }\n }).then(null, function (err) {\n //if an error occurs, and its not a cancellation, then show a placeholder\n if (err.name === \"Canceled\") {\n return WinJS.Promise.wrapError(err);\n } else {\n img = element.querySelector(\"img\");\n if (img) {\n img.src = \"/images/placeholder-sdk.png\";\n img.style.opacity = 1;\n }\n return;\n }\n })\n };\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = !0;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates, isBatchingUpdates || isRendering || performWork(Sync$1, null);\n }\n }","renderInsidePatch() {\n\t\tif (this.component_.wasRendered && !this.shouldUpdate(this.changes_)) {\n\t\t\tthis.skipRerender_();\n\t\t\treturn;\n\t\t}\n\t\tthis.renderInsidePatchDontSkip_();\n\t}","_renderBuffers() {\n let buffers = this._bufferData;\n this._buffers.clearLayers();\n if (!buffers) return;\n\n buffers.features.forEach((feature) => {\n if (this._state[feature.properties.id]) {\n this._buffers.addData(feature);\n }\n }, this);\n }","function MultiRenderer()\n{\n this._views = [];\n}","function rerenderall() {\n console.log(\"Step 4\");\n rerenderElements(\"runs\");\n rerenderElements(\"configs\");\n rerenderElements(\"evals\");\n rerenderElements(\"locations\");\n}","flush() {\n this._renderer.flush();\n }","function enqueueUpdate(component) {\n\t\t ensureInjected();\n\t\t\n\t\t // Various parts of our code (such as ReactCompositeComponent's\n\t\t // _renderValidatedComponent) assume that calls to render aren't nested;\n\t\t // verify that that's the case. (This is called by each top-level update\n\t\t // function, like setState, forceUpdate, etc.; creation and\n\t\t // destruction of top-level components is guarded in ReactMount.)\n\t\t\n\t\t if (!batchingStrategy.isBatchingUpdates) {\n\t\t batchingStrategy.batchedUpdates(enqueueUpdate, component);\n\t\t return;\n\t\t }\n\t\t\n\t\t dirtyComponents.push(component);\n\t\t if (component._updateBatchNumber == null) {\n\t\t component._updateBatchNumber = updateBatchNumber + 1;\n\t\t }\n\t\t}","function useBatchFrameState() {\n var _useState = (0, React.useState)({}),\n _useState2 = (0, _slicedToArray2.default)(_useState, 2),\n forceUpdate = _useState2[1];\n\n var statesRef = (0, React.useRef)([]);\n var destroyRef = (0, React.useRef)(false);\n var walkingIndex = 0;\n var beforeFrameId = 0;\n (0, React.useEffect)(function () {\n return function () {\n destroyRef.current = true;\n };\n }, []);\n\n function createState(defaultValue) {\n var myIndex = walkingIndex;\n walkingIndex += 1; // Fill value if not exist yet\n\n if (statesRef.current.length < myIndex + 1) {\n statesRef.current[myIndex] = defaultValue;\n } // Return filled as `setState`\n\n\n var value = statesRef.current[myIndex];\n\n function setValue(val) {\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\n wrapperRaf$2.cancel(beforeFrameId); // Flush with batch\n\n beforeFrameId = wrapperRaf$2(function () {\n if (!destroyRef.current) {\n forceUpdate({});\n }\n });\n }\n\n return [value, setValue];\n }\n\n return createState;\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}"],"string":"[\n \"updateBatches() {\\n if (this.dirty === this.cacheDirty) {\\n return;\\n }\\n if (this.graphicsData.length === 0) {\\n return;\\n }\\n if (this.dirty !== this.cacheDirty) {\\n for (var i = 0; i < this.graphicsData.length; i++) {\\n var data = this.graphicsData[i];\\n // reveal(data.fillStyle.texture.baseTexture.resource);\\n // reveal(data.lineStyle.texture.baseTexture.resource);\\n if (data.fillStyle && !data.fillStyle.texture.baseTexture.valid) {\\n return;\\n }\\n if (data.lineStyle && !data.lineStyle.texture.baseTexture.valid) {\\n return;\\n }\\n }\\n }\\n this.cacheDirty = this.dirty;\\n var uvs = this.uvs;\\n var batchPart = this.batches.pop()\\n || GraphicsGeometry.BATCH_POOL.pop()\\n || new BatchPart();\\n batchPart.style = batchPart.style\\n || this.graphicsData[0].fillStyle\\n || this.graphicsData[0].lineStyle;\\n var currentTexture = batchPart.style.texture.baseTexture;\\n // reveal(currentTexture);\\n var currentColor = batchPart.style.color + batchPart.style.alpha;\\n this.batches.push(batchPart);\\n // reveal(this.batches);\\n // TODO - this can be simplified\\n for (var i$1 = this.shapeIndex; i$1 < this.graphicsData.length; i$1++) {\\n this.shapeIndex++;\\n var data$1 = this.graphicsData[i$1];\\n // reveal(data$1);\\n var command = GraphicsGeometry.getFillCommand(data$1.type);\\n // reveal(command)\\n var fillStyle = data$1.fillStyle;\\n var lineStyle = data$1.lineStyle;\\n // build out the shapes points..\\n command.build(data$1);\\n if (data$1.matrix) {\\n this.transformPoints(data$1.points, data$1.matrix);\\n // reveal(data$1.points)\\n // \\treveal(data$1.matrix)\\n }\\n for (var j = 0; j < 2; j++) {\\n var style = (j === 0) ? fillStyle : lineStyle;\\n if (!style.visible) {\\n continue;\\n }\\n var nextTexture = style.texture.baseTexture;\\n if (currentTexture !== nextTexture || (style.color + style.alpha) !== currentColor) {\\n // TODO use a const\\n nextTexture.wrapMode = 10497;\\n currentTexture = nextTexture;\\n currentColor = style.color + style.alpha;\\n var index$1 = this.indices.length;\\n var attribIndex = this.points.length / 2;\\n batchPart.size = index$1 - batchPart.start;\\n batchPart.attribSize = attribIndex - batchPart.attribStart;\\n if (batchPart.size > 0) {\\n batchPart = GraphicsGeometry.BATCH_POOL.pop() || new BatchPart();\\n this.batches.push(batchPart);\\n }\\n batchPart.style = style;\\n batchPart.start = index$1;\\n batchPart.attribStart = attribIndex;\\n // TODO add this to the render part..\\n }\\n var start = this.points.length / 2;\\n if (j === 0) {\\n if (data$1.holes.length) {\\n this.processHoles(data$1.holes);\\n GraphicsGeometry.buildPoly.triangulate(data$1, this);\\n }\\n else {\\n command.triangulate(data$1, this);\\n }\\n }\\n else {\\n GraphicsGeometry.buildLine(data$1, this);\\n for (var i$2 = 0; i$2 < data$1.holes.length; i$2++) {\\n GraphicsGeometry.buildLine(data$1.holes[i$2], this);\\n }\\n }\\n var size = (this.points.length / 2) - start;\\n this.addUvs(this.points, uvs, style.texture, start, size, style.matrix);\\n }\\n }\\n var index = this.indices.length;\\n var attrib = this.points.length / 2;\\n batchPart.size = index - batchPart.start;\\n batchPart.attribSize = attrib - batchPart.attribStart;\\n this.indicesUint16 = new Uint16Array(this.indices);\\n // TODO make this a const..\\n this.batchable = this.isBatchable();\\n if (this.batchable) {\\n this.batchDirty++;\\n this.uvsFloat32 = new Float32Array(this.uvs);\\n // offset the indices so that it works with the batcher...\\n for (var i$3 = 0; i$3 < this.batches.length; i$3++) {\\n var batch = this.batches[i$3];\\n for (var j$1 = 0; j$1 < batch.size; j$1++) {\\n var index$2 = batch.start + j$1;\\n this.indicesUint16[index$2] = this.indicesUint16[index$2] - batch.attribStart;\\n }\\n }\\n }\\n else {\\n this.buildDrawCalls();\\n }\\n }\",\n \"flush() {\\n // trace(\\\"BatchRender flush \\\" + this.currentSize)\\n if (this.currentSize === 0) {\\n return;\\n }\\n var gl = this.renderer.gl;\\n var MAX_TEXTURES = this.MAX_TEXTURES;\\n var buffer = this.getAttributeBuffer(this.currentSize);\\n // reveal(buffer);\\n var indexBuffer = this.getIndexBuffer(this.currentIndexSize);\\n // reveal(indexBuffer);\\n var elements = this.elements;\\n var groups = this.groups;\\n var float32View = buffer.float32View;\\n // reveal(float32View);\\n var uint32View = buffer.uint32View;\\n // reveal(uint32View);\\n var touch = this.renderer.textureGC.count;\\n var index = 0;\\n var indexCount = 0;\\n var nextTexture;\\n var currentTexture;\\n var groupCount = 0;\\n var textureCount = 0;\\n var currentGroup = groups[0];\\n // reveal(currentGroup);\\n var blendMode = -1; // premultiplyBlendMode[elements[0]._texture.baseTexture.premultiplyAlpha ? 0 : ][elements[0].blendMode];\\n currentGroup.textureCount = 0;\\n currentGroup.start = 0;\\n currentGroup.blend = blendMode;\\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\\n var i;\\n for (i = 0; i < this.currentIndex; ++i) {\\n // upload the sprite elements...\\n // they have all ready been calculated so we just need to push them into the buffer.\\n var sprite = elements[i];\\n elements[i] = null;\\n nextTexture = sprite._texture.baseTexture;\\n // reveal(nextTexture);\\n var spriteBlendMode = BlendModesSettings_1.BlendModesSettings.premultiplyBlendMode[nextTexture.premultiplyAlpha ? 1 : 0][sprite.blendMode];\\n if (blendMode !== spriteBlendMode) {\\n blendMode = spriteBlendMode;\\n // force the batch to break!\\n currentTexture = null;\\n textureCount = MAX_TEXTURES;\\n TICK++;\\n }\\n if (currentTexture !== nextTexture) {\\n currentTexture = nextTexture;\\n if (nextTexture._batchEnabled !== TICK) {\\n if (textureCount === MAX_TEXTURES) {\\n TICK++;\\n textureCount = 0;\\n currentGroup.size = indexCount - currentGroup.start;\\n currentGroup = groups[groupCount++];\\n currentGroup.textureCount = 0;\\n currentGroup.blend = blendMode;\\n currentGroup.start = indexCount;\\n }\\n nextTexture.touched = touch;\\n nextTexture._batchEnabled = TICK;\\n nextTexture._id = textureCount;\\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\\n // reveal(currentGroup);\\n // reveal(nextTexture);\\n textureCount++;\\n }\\n }\\n this.packGeometry(sprite, float32View, uint32View, indexBuffer, index, indexCount); // argb, nextTexture._id, float32View, uint32View, indexBuffer, index, indexCount);\\n // HERE \\n // push a graphics..\\n index += (sprite.vertexData.length / 2) * this.vertSize;\\n indexCount += sprite.indices.length;\\n }\\n BaseTexture_1.BaseTexture._globalBatch = TICK;\\n currentGroup.size = indexCount - currentGroup.start;\\n // this.indexBuffer.update();\\n if (!WebGLSettings_1.WebGLSettings.CAN_UPLOAD_SAME_BUFFER) {\\n // this is still needed for IOS performance..\\n // it really does not like uploading to the same buffer in a single frame!\\n if (this.vaoMax <= this.vertexCount) {\\n this.vaoMax++;\\n /* eslint-disable max-len */\\n this.vaos[this.vertexCount] = new BatchGeometry_1.BatchGeometry();\\n }\\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\\n // this.vertexBuffers[this.vertexCount].update(buffer.vertices, 0);\\n this.renderer.geometry.bind(this.vaos[this.vertexCount]);\\n this.renderer.geometry.updateBuffers();\\n this.vertexCount++;\\n }\\n else {\\n // lets use the faster option, always use buffer number 0\\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\\n // if (true)// this.spriteOnly)\\n // {\\n // this.vaos[this.vertexCount].indexBuffer = this.defualtSpriteIndexBuffer;\\n // this.vaos[this.vertexCount].buffers[1] = this.defualtSpriteIndexBuffer;\\n // }\\n // this.vaos[0].attributes.aColor.stride = 24\\n // this.vaos[0].attributes.aColor.start = 16\\n // NOT SET\\n // this.vaos[0].attributes.aTextureCoord.stride = 24\\n // this.vaos[0].attributes.aTextureCoord.start = 8\\n // NOT SET\\n // this.vaos[0].attributes.aVertexPosition.stride = 24\\n // NOT SET\\n this.renderer.geometry.updateBuffers();\\n // \\n }\\n // this.renderer.state.set(this.state);\\n var textureSystem = this.renderer.texture;\\n var stateSystem = this.renderer.state;\\n // e.log(groupCount);\\n // / render the groups..\\n // trace(\\\"groupcount: \\\" + groupCount)\\n // trace(\\\"BatchRenderer count: \\\" + groupCount)\\n for (i = 0; i < groupCount; i++) {\\n var group = groups[i];\\n var groupTextureCount = group.textureCount;\\n for (var j = 0; j < groupTextureCount; j++) {\\n // trace(\\\"possible textureSystem bind call (BathRenderer)\\\")\\n // trace(\\\"binding: \\\" + group.textures[j] + \\\" to \\\" + j)\\n textureSystem.bind(group.textures[j], j);\\n group.textures[j] = null;\\n }\\n // this.state.blendMode = group.blend;\\n // this.state.blend = true;\\n // this.renderer.state.setState(this.state);\\n // set the blend mode..\\n stateSystem.setBlendMode(group.blend);\\n gl.drawElements(group.type, group.size, gl.UNSIGNED_SHORT, group.start * 2);\\n }\\n // reset elements for the next flush\\n this.currentIndex = 0;\\n this.currentSize = 0;\\n this.currentIndexSize = 0;\\n }\",\n \"function RenderBatch() {\\n\\tthis.mRenderData = new Array();\\n\\t\\n\\tthis.mNeedSort = false;\\n\\tthis.mFrustrumCull = true;\\n}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\\n var ancestors = parent\\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\\n : [];\\n write(function () {\\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\\n },\\n };\\n}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\\n var ancestors = parent\\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\\n : [];\\n write(function () {\\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\\n },\\n };\\n}\",\n \"function enqueueUpdate(component){ensureInjected();// Various parts of our code (such as ReactCompositeComponent's\\n// _renderValidatedComponent) assume that calls to render aren't nested;\\n// verify that that's the case. (This is called by each top-level update\\n// function, like setState, forceUpdate, etc.; creation and\\n// destruction of top-level components is guarded in ReactMount.)\\nif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);if(component._updateBatchNumber==null){component._updateBatchNumber=updateBatchNumber+1;}}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n var order = Array.from(queue).sort(compareByDepth);\\n if (parent) {\\n withoutTreeTransform(parent, function () {\\n batchResetAndMeasure(order);\\n });\\n }\\n else {\\n batchResetAndMeasure(order);\\n }\\n /**\\n * Write: Notify the VisualElements they're ready for further write operations.\\n */\\n order.forEach(layoutReady);\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n flushSync.preRender();\\n flushSync.render();\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n sync.postRender(function () { return order.forEach(assignProjectionToSnapshot); });\\n queue.clear();\\n },\\n };\\n}\",\n \"function u(e) {\\n // Various parts of our code (such as ReactCompositeComponent's\\n // _renderValidatedComponent) assume that calls to render aren't nested;\\n // verify that that's the case. (This is called by each top-level update\\n // function, like setState, forceUpdate, etc.; creation and\\n // destruction of top-level components is guarded in ReactMount.)\\n if (r(), !C.isBatchingUpdates) return void C.batchedUpdates(u, e);\\n v.push(e), null == e._updateBatchNumber && (e._updateBatchNumber = y + 1);\\n }\",\n \"buildDrawCalls() {\\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\\n for (var i = 0; i < this.drawCalls.length; i++) {\\n this.drawCalls[i].textures.length = 0;\\n GraphicsGeometry.DRAW_CALL_POOL.push(this.drawCalls[i]);\\n }\\n this.drawCalls.length = 0;\\n var uvs = this.uvs;\\n var colors = this.colors;\\n var textureIds = this.textureIds;\\n var currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\\n currentGroup.textureCount = 0;\\n currentGroup.start = 0;\\n currentGroup.size = 0;\\n currentGroup.type = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n var textureCount = 0;\\n var currentTexture = null;\\n var textureId = 0;\\n var native = false;\\n var drawMode = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n var index = 0;\\n this.drawCalls.push(currentGroup);\\n // TODO - this can be simplified\\n for (var i$1 = 0; i$1 < this.batches.length; i$1++) {\\n var data = this.batches[i$1];\\n // TODO add some full on MAX_TEXTURE CODE..\\n var MAX_TEXTURES = 8;\\n var style = data.style;\\n var nextTexture = style.texture.baseTexture;\\n if (native !== style.native) {\\n native = style.native;\\n drawMode = native ? DrawModeSettings_1.DrawModeSettings.DRAW_MODES.LINES : DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n // force the batch to break!\\n currentTexture = null;\\n textureCount = MAX_TEXTURES;\\n TICK++;\\n }\\n if (currentTexture !== nextTexture) {\\n currentTexture = nextTexture;\\n if (nextTexture._batchEnabled !== TICK) {\\n if (textureCount === MAX_TEXTURES) {\\n TICK++;\\n textureCount = 0;\\n if (currentGroup.size > 0) {\\n currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\\n this.drawCalls.push(currentGroup);\\n }\\n currentGroup.start = index;\\n currentGroup.size = 0;\\n currentGroup.textureCount = 0;\\n currentGroup.type = drawMode;\\n }\\n // TODO add this to the render part..\\n nextTexture.touched = 1; // touch;\\n nextTexture._batchEnabled = TICK;\\n nextTexture._id = textureCount;\\n nextTexture.wrapMode = 10497;\\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\\n textureCount++;\\n }\\n }\\n currentGroup.size += data.size;\\n index += data.size;\\n textureId = nextTexture._id;\\n this.addColors(colors, style.color, style.alpha, data.attribSize);\\n this.addTextureIds(textureIds, textureId, data.attribSize);\\n }\\n BaseTexture_1.BaseTexture._globalBatch = TICK;\\n // upload..\\n // merge for now!\\n var verts = this.points;\\n // verts are 2 positions.. so we * by 3 as there are 6 properties.. then 4 cos its bytes\\n var glPoints = new ArrayBuffer(verts.length * 3 * 4);\\n var f32 = new Float32Array(glPoints);\\n var u32 = new Uint32Array(glPoints);\\n var p = 0;\\n for (var i$2 = 0; i$2 < verts.length / 2; i$2++) {\\n f32[p++] = verts[i$2 * 2];\\n f32[p++] = verts[(i$2 * 2) + 1];\\n f32[p++] = uvs[i$2 * 2];\\n f32[p++] = uvs[(i$2 * 2) + 1];\\n u32[p++] = colors[i$2];\\n f32[p++] = textureIds[i$2];\\n }\\n this._buffer.update(glPoints);\\n this._indexBuffer.update(this.indicesUint16);\\n }\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\r\\n globalState.inBatch++;\\r\\n}\",\n \"function batchedUpdates(fn, a) {\\n\\t var previousIsBatchingUpdates = isBatchingUpdates;\\n\\t isBatchingUpdates = true;\\n\\t try {\\n\\t return fn(a);\\n\\t } finally {\\n\\t isBatchingUpdates = previousIsBatchingUpdates;\\n\\t if (!isBatchingUpdates && !isRendering) {\\n\\t performWork(Sync, null);\\n\\t }\\n\\t }\\n\\t }\",\n \"function addToBatchCache() {\\n\\t\\t\\n\\t\\tTHREE.WebGLBatchCompiler.batchCache.push( new THREE.WebGLBatchCompiler.batchCacheObject( geometry, materials, mesh.webGLBatches, mesh.webGLIsTransparent ));\\n\\t}\",\n \"updateRenderers_() {\\n this.renderers = this.staticRenderers.concat(this.getDynamicRenderers()).sort(rendererPrioritySort);\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n }\\n finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n batchLayout(function (read, write) {\\n var order = Array.from(queue).sort(compareByDepth);\\n var ancestors = parent\\n ? collectProjectingAncestors(parent)\\n : [];\\n write(function () {\\n var allElements = __spreadArray(__spreadArray([], __read(ancestors)), __read(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n flushSync.preRender();\\n flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n es.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n flushLayout();\\n },\\n };\\n}\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function _startBatch() {\\n ++_batch;\\n }\",\n \"render(delta, spriteBatch) {}\",\n \"function useBatchFrameState() {\\n var _useState = (0,react__WEBPACK_IMPORTED_MODULE_1__.useState)({}),\\n _useState2 = (0,_babel_runtime_helpers_esm_slicedToArray__WEBPACK_IMPORTED_MODULE_0__.default)(_useState, 2),\\n forceUpdate = _useState2[1];\\n\\n var statesRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)([]);\\n var destroyRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)(false);\\n var walkingIndex = 0;\\n var beforeFrameId = 0;\\n (0,react__WEBPACK_IMPORTED_MODULE_1__.useEffect)(function () {\\n return function () {\\n destroyRef.current = true;\\n };\\n }, []);\\n\\n function createState(defaultValue) {\\n var myIndex = walkingIndex;\\n walkingIndex += 1; // Fill value if not exist yet\\n\\n if (statesRef.current.length < myIndex + 1) {\\n statesRef.current[myIndex] = defaultValue;\\n } // Return filled as `setState`\\n\\n\\n var value = statesRef.current[myIndex];\\n\\n function setValue(val) {\\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\\n rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default.cancel(beforeFrameId); // Flush with batch\\n\\n beforeFrameId = (0,rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default)(function () {\\n if (!destroyRef.current) {\\n forceUpdate({});\\n }\\n });\\n }\\n\\n return [value, setValue];\\n }\\n\\n return createState;\\n}\",\n \"function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\\n\\t// _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t// verify that that's the case. (This is called by each top-level update\\n\\t// function, like setProps, setState, forceUpdate, etc.; creation and\\n\\t// destruction of top-level components is guarded in ReactMount.)\\n\\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}\",\n \"function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\\n\\t// _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t// verify that that's the case. (This is called by each top-level update\\n\\t// function, like setProps, setState, forceUpdate, etc.; creation and\\n\\t// destruction of top-level components is guarded in ReactMount.)\\n\\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}\",\n \"function createBatcher() {\\n var queue = new Set();\\n var add = function (child) { return queue.add(child); };\\n var flush = function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, measureLayout = _b.measureLayout, layoutReady = _b.layoutReady, parent = _b.parent;\\n var order = Array.from(queue).sort(sortByDepth);\\n var resetAndMeasure = function () {\\n /**\\n * Write: Reset any transforms on children elements so we can read their actual layout\\n */\\n order.forEach(function (child) { return child.resetTransform(); });\\n /**\\n * Read: Measure the actual layout\\n */\\n order.forEach(measureLayout);\\n };\\n parent ? parent.withoutTransform(resetAndMeasure) : resetAndMeasure();\\n /**\\n * Write: Notify the VisualElements they're ready for further write operations.\\n */\\n order.forEach(layoutReady);\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n queue.clear();\\n };\\n return { add: add, flush: flush };\\n}\",\n \"function batchedUpdates(callback) {\\n if (isBatchingUpdates) {\\n // We're already executing in an environment where updates will be batched,\\n // so this is a no-op.\\n callback();\\n return;\\n }\\n\\n isBatchingUpdates = true;\\n\\n try {\\n callback();\\n // TODO: Sort components by depth such that parent components update first\\n for (var i = 0; i < dirtyComponents.length; i++) {\\n // If a component is unmounted before pending changes apply, ignore them\\n // TODO: Queue unmounts in the same list to avoid this happening at all\\n var component = dirtyComponents[i];\\n if (component.isMounted()) {\\n // If performUpdateIfNecessary happens to enqueue any new updates, we\\n // shouldn't execute the callbacks until the next render happens, so\\n // stash the callbacks first\\n var callbacks = component._pendingCallbacks;\\n component._pendingCallbacks = null;\\n component.performUpdateIfNecessary();\\n if (callbacks) {\\n for (var j = 0; j < callbacks.length; j++) {\\n callbacks[j].call(component);\\n }\\n }\\n }\\n }\\n } catch (error) {\\n // IE8 requires `catch` in order to use `finally`.\\n throw error;\\n } finally {\\n dirtyComponents.length = 0;\\n isBatchingUpdates = false;\\n }\\n}\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"onRowsRerender() {\\n this.scheduleDraw(true);\\n }\",\n \"rerender(temp, temp2, renderChunkBorder) {\\r\\n this.resizeOffscreenCanvas()\\r\\n //this.ctx.drawImage(Chunk.texture, 0,0, this.image.width, this.image.height);\\r\\n this.objects.forEach(obj => {\\r\\n obj.render(this);\\r\\n }); \\r\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"afterRender() { }\",\n \"afterRender() { }\",\n \"onBatchEnd() {\\n this.logEventBatch(this.batchedEvents);\\n const changeEvts = this.batchedEvents.filter((event) => event.isTreeChange);\\n // TODO this is a bit spaghetti-ish, we should probably\\n // have an event that fires and is listened to. This code shouldn't\\n // know about the node tree.\\n window.nodeTree.processTreeChanges(changeEvts);\\n this.batchedEvents = [];\\n }\",\n \"updateMultiTexture() {\\n\\t\\tthis.chunk.forEach(function(row, i, arr) {\\n\\t\\t\\trow.forEach(function(item, j, rarr) {\\n\\t\\t\\t\\titem.updateMultiTexture();\\n\\t\\t\\t})\\n\\t\\t});\\n\\t}\",\n \"function useBatchFrameState() {\\n var _useState = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useState\\\"])({}),\\n _useState2 = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__babel_runtime_helpers_esm_slicedToArray__[\\\"a\\\" /* default */])(_useState, 2),\\n forceUpdate = _useState2[1];\\n\\n var statesRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useRef\\\"])([]);\\n var destroyRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useRef\\\"])(false);\\n var walkingIndex = 0;\\n var beforeFrameId = 0;\\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useEffect\\\"])(function () {\\n return function () {\\n destroyRef.current = true;\\n };\\n }, []);\\n\\n function createState(defaultValue) {\\n var myIndex = walkingIndex;\\n walkingIndex += 1; // Fill value if not exist yet\\n\\n if (statesRef.current.length < myIndex + 1) {\\n statesRef.current[myIndex] = defaultValue;\\n } // Return filled as `setState`\\n\\n\\n var value = statesRef.current[myIndex];\\n\\n function setValue(val) {\\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\\n __WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\\\"a\\\" /* default */].cancel(beforeFrameId); // Flush with batch\\n\\n beforeFrameId = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\\\"a\\\" /* default */])(function () {\\n if (!destroyRef.current) {\\n forceUpdate({});\\n }\\n });\\n }\\n\\n return [value, setValue];\\n }\\n\\n return createState;\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedCallback(callback) {\\n\\treturn function(err, res) {\\n\\t\\tReactUpdates.batchedUpdates(callback.bind(null, err, res));\\n\\t}\\n}\",\n \"function batchRenderer(itemPromise, recycled) {\\n var element, label, item, img;\\n if (!recycled) {\\n // create a basic template for the item which doesn't depend on the data\\n element = document.createElement(\\\"div\\\");\\n element.className = \\\"itemTempl\\\";\\n element.innerHTML = \\\"<div class='content'>...</div>\\\";\\n }\\n else {\\n // clean up the recycled element so that we can re-use it rather than having\\n // to create the html from scratch\\n element = recycled;\\n label = element.querySelector(\\\".content\\\");\\n label.innerHTML = \\\"...\\\";\\n // remove the image if its arealy there\\n img = element.querySelector(\\\"img\\\");\\n if (img) { element.removeChild(img); }\\n }\\n // return the element as the placeholder, and a callback to update it when data is available\\n return {\\n element: element,\\n // specifies a promise that will be completed when rendering is complete\\n // itemPromise will complete when the data is available\\n renderComplete: itemPromise.then(function (i) {\\n item = i;\\n // mutate the element to update only the title\\n if (!label) { label = element.querySelector(\\\".content\\\"); }\\n label.innerText = item.data.title;\\n // use the item.ready promise to delay the more expensive work\\n return item.ready;\\n // use the ability to chain promises, to enable work to be cancelled\\n }).then(function () {\\n //use the image loader to queue the loading of the image\\n return item.loadImage(item.data.thumbnail);\\n }).then(thumbnailBatch()\\n ).then(function (newimg) {\\n img = newimg;\\n element.insertBefore(img, element.firstElementChild);\\n return item.isOnScreen();\\n }).then(function (onscreen) {\\n if (!onscreen) {\\n //if the item is not visible, then don't animate its opacity\\n img.style.opacity = 1;\\n } else {\\n //if the item is visible then animate the opacity of the image\\n WinJS.UI.Animation.fadeIn(img);\\n }\\n }).then(null, function (err) {\\n //if an error occurs, and its not a cancellation, then show a placeholder\\n if (err.name === \\\"Canceled\\\") {\\n return WinJS.Promise.wrapError(err);\\n } else {\\n img = element.querySelector(\\\"img\\\");\\n if (img) {\\n img.src = \\\"/images/placeholder-sdk.png\\\";\\n img.style.opacity = 1;\\n }\\n return;\\n }\\n })\\n };\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = !0;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates, isBatchingUpdates || isRendering || performWork(Sync$1, null);\\n }\\n }\",\n \"renderInsidePatch() {\\n\\t\\tif (this.component_.wasRendered && !this.shouldUpdate(this.changes_)) {\\n\\t\\t\\tthis.skipRerender_();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tthis.renderInsidePatchDontSkip_();\\n\\t}\",\n \"_renderBuffers() {\\n let buffers = this._bufferData;\\n this._buffers.clearLayers();\\n if (!buffers) return;\\n\\n buffers.features.forEach((feature) => {\\n if (this._state[feature.properties.id]) {\\n this._buffers.addData(feature);\\n }\\n }, this);\\n }\",\n \"function MultiRenderer()\\n{\\n this._views = [];\\n}\",\n \"function rerenderall() {\\n console.log(\\\"Step 4\\\");\\n rerenderElements(\\\"runs\\\");\\n rerenderElements(\\\"configs\\\");\\n rerenderElements(\\\"evals\\\");\\n rerenderElements(\\\"locations\\\");\\n}\",\n \"flush() {\\n this._renderer.flush();\\n }\",\n \"function enqueueUpdate(component) {\\n\\t\\t ensureInjected();\\n\\t\\t\\n\\t\\t // Various parts of our code (such as ReactCompositeComponent's\\n\\t\\t // _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t\\t // verify that that's the case. (This is called by each top-level update\\n\\t\\t // function, like setState, forceUpdate, etc.; creation and\\n\\t\\t // destruction of top-level components is guarded in ReactMount.)\\n\\t\\t\\n\\t\\t if (!batchingStrategy.isBatchingUpdates) {\\n\\t\\t batchingStrategy.batchedUpdates(enqueueUpdate, component);\\n\\t\\t return;\\n\\t\\t }\\n\\t\\t\\n\\t\\t dirtyComponents.push(component);\\n\\t\\t if (component._updateBatchNumber == null) {\\n\\t\\t component._updateBatchNumber = updateBatchNumber + 1;\\n\\t\\t }\\n\\t\\t}\",\n \"function useBatchFrameState() {\\n var _useState = (0, React.useState)({}),\\n _useState2 = (0, _slicedToArray2.default)(_useState, 2),\\n forceUpdate = _useState2[1];\\n\\n var statesRef = (0, React.useRef)([]);\\n var destroyRef = (0, React.useRef)(false);\\n var walkingIndex = 0;\\n var beforeFrameId = 0;\\n (0, React.useEffect)(function () {\\n return function () {\\n destroyRef.current = true;\\n };\\n }, []);\\n\\n function createState(defaultValue) {\\n var myIndex = walkingIndex;\\n walkingIndex += 1; // Fill value if not exist yet\\n\\n if (statesRef.current.length < myIndex + 1) {\\n statesRef.current[myIndex] = defaultValue;\\n } // Return filled as `setState`\\n\\n\\n var value = statesRef.current[myIndex];\\n\\n function setValue(val) {\\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\\n wrapperRaf$2.cancel(beforeFrameId); // Flush with batch\\n\\n beforeFrameId = wrapperRaf$2(function () {\\n if (!destroyRef.current) {\\n forceUpdate({});\\n }\\n });\\n }\\n\\n return [value, setValue];\\n }\\n\\n return createState;\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.66125363","0.6573637","0.65539813","0.6537788","0.6537788","0.61356914","0.60868585","0.60497123","0.6024147","0.5976598","0.59277225","0.59277225","0.59277225","0.59277225","0.59277225","0.59277225","0.59277225","0.59277225","0.59277225","0.58802736","0.5857833","0.58310586","0.58121777","0.5808082","0.5799709","0.5796103","0.5796103","0.57745326","0.5765288","0.5757712","0.57510024","0.57510024","0.574246","0.57418096","0.57402563","0.57402563","0.57402563","0.57402563","0.57402563","0.57402563","0.57402563","0.57402563","0.57402563","0.57402563","0.57402563","0.57402563","0.5718079","0.56976384","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56563014","0.56402266","0.56402266","0.56332135","0.56170774","0.5614545","0.5598403","0.5591266","0.55866474","0.55696553","0.5568037","0.55640185","0.55555046","0.55510324","0.55387276","0.55097586","0.5508754","0.5507519","0.5507519","0.5507519","0.5507519","0.5507519","0.5507519","0.5507519"],"string":"[\n \"0.66125363\",\n \"0.6573637\",\n \"0.65539813\",\n \"0.6537788\",\n \"0.6537788\",\n \"0.61356914\",\n \"0.60868585\",\n \"0.60497123\",\n \"0.6024147\",\n \"0.5976598\",\n \"0.59277225\",\n \"0.59277225\",\n \"0.59277225\",\n \"0.59277225\",\n \"0.59277225\",\n \"0.59277225\",\n \"0.59277225\",\n \"0.59277225\",\n \"0.59277225\",\n \"0.58802736\",\n \"0.5857833\",\n \"0.58310586\",\n \"0.58121777\",\n \"0.5808082\",\n \"0.5799709\",\n \"0.5796103\",\n \"0.5796103\",\n \"0.57745326\",\n \"0.5765288\",\n \"0.5757712\",\n \"0.57510024\",\n \"0.57510024\",\n \"0.574246\",\n \"0.57418096\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.57402563\",\n \"0.5718079\",\n \"0.56976384\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56563014\",\n \"0.56402266\",\n \"0.56402266\",\n \"0.56332135\",\n \"0.56170774\",\n \"0.5614545\",\n \"0.5598403\",\n \"0.5591266\",\n \"0.55866474\",\n \"0.55696553\",\n \"0.5568037\",\n \"0.55640185\",\n \"0.55555046\",\n \"0.55510324\",\n \"0.55387276\",\n \"0.55097586\",\n \"0.5508754\",\n \"0.5507519\",\n \"0.5507519\",\n \"0.5507519\",\n \"0.5507519\",\n \"0.5507519\",\n \"0.5507519\",\n \"0.5507519\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5795,"cells":{"query":{"kind":"string","value":"TODO: Batching should be implemented at the renderer level, not within the reconciler."},"document":{"kind":"string","value":"function flushSync(fn, a) {\n !!isRendering ? invariant(false, 'flushSync was called from inside a lifecycle method. It cannot be called when React is already rendering.') : void 0;\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return syncUpdates(fn, a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n performSyncWork();\n }\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["updateBatches() {\n if (this.dirty === this.cacheDirty) {\n return;\n }\n if (this.graphicsData.length === 0) {\n return;\n }\n if (this.dirty !== this.cacheDirty) {\n for (var i = 0; i < this.graphicsData.length; i++) {\n var data = this.graphicsData[i];\n // reveal(data.fillStyle.texture.baseTexture.resource);\n // reveal(data.lineStyle.texture.baseTexture.resource);\n if (data.fillStyle && !data.fillStyle.texture.baseTexture.valid) {\n return;\n }\n if (data.lineStyle && !data.lineStyle.texture.baseTexture.valid) {\n return;\n }\n }\n }\n this.cacheDirty = this.dirty;\n var uvs = this.uvs;\n var batchPart = this.batches.pop()\n || GraphicsGeometry.BATCH_POOL.pop()\n || new BatchPart();\n batchPart.style = batchPart.style\n || this.graphicsData[0].fillStyle\n || this.graphicsData[0].lineStyle;\n var currentTexture = batchPart.style.texture.baseTexture;\n // reveal(currentTexture);\n var currentColor = batchPart.style.color + batchPart.style.alpha;\n this.batches.push(batchPart);\n // reveal(this.batches);\n // TODO - this can be simplified\n for (var i$1 = this.shapeIndex; i$1 < this.graphicsData.length; i$1++) {\n this.shapeIndex++;\n var data$1 = this.graphicsData[i$1];\n // reveal(data$1);\n var command = GraphicsGeometry.getFillCommand(data$1.type);\n // reveal(command)\n var fillStyle = data$1.fillStyle;\n var lineStyle = data$1.lineStyle;\n // build out the shapes points..\n command.build(data$1);\n if (data$1.matrix) {\n this.transformPoints(data$1.points, data$1.matrix);\n // reveal(data$1.points)\n // \treveal(data$1.matrix)\n }\n for (var j = 0; j < 2; j++) {\n var style = (j === 0) ? fillStyle : lineStyle;\n if (!style.visible) {\n continue;\n }\n var nextTexture = style.texture.baseTexture;\n if (currentTexture !== nextTexture || (style.color + style.alpha) !== currentColor) {\n // TODO use a const\n nextTexture.wrapMode = 10497;\n currentTexture = nextTexture;\n currentColor = style.color + style.alpha;\n var index$1 = this.indices.length;\n var attribIndex = this.points.length / 2;\n batchPart.size = index$1 - batchPart.start;\n batchPart.attribSize = attribIndex - batchPart.attribStart;\n if (batchPart.size > 0) {\n batchPart = GraphicsGeometry.BATCH_POOL.pop() || new BatchPart();\n this.batches.push(batchPart);\n }\n batchPart.style = style;\n batchPart.start = index$1;\n batchPart.attribStart = attribIndex;\n // TODO add this to the render part..\n }\n var start = this.points.length / 2;\n if (j === 0) {\n if (data$1.holes.length) {\n this.processHoles(data$1.holes);\n GraphicsGeometry.buildPoly.triangulate(data$1, this);\n }\n else {\n command.triangulate(data$1, this);\n }\n }\n else {\n GraphicsGeometry.buildLine(data$1, this);\n for (var i$2 = 0; i$2 < data$1.holes.length; i$2++) {\n GraphicsGeometry.buildLine(data$1.holes[i$2], this);\n }\n }\n var size = (this.points.length / 2) - start;\n this.addUvs(this.points, uvs, style.texture, start, size, style.matrix);\n }\n }\n var index = this.indices.length;\n var attrib = this.points.length / 2;\n batchPart.size = index - batchPart.start;\n batchPart.attribSize = attrib - batchPart.attribStart;\n this.indicesUint16 = new Uint16Array(this.indices);\n // TODO make this a const..\n this.batchable = this.isBatchable();\n if (this.batchable) {\n this.batchDirty++;\n this.uvsFloat32 = new Float32Array(this.uvs);\n // offset the indices so that it works with the batcher...\n for (var i$3 = 0; i$3 < this.batches.length; i$3++) {\n var batch = this.batches[i$3];\n for (var j$1 = 0; j$1 < batch.size; j$1++) {\n var index$2 = batch.start + j$1;\n this.indicesUint16[index$2] = this.indicesUint16[index$2] - batch.attribStart;\n }\n }\n }\n else {\n this.buildDrawCalls();\n }\n }","function RenderBatch() {\n\tthis.mRenderData = new Array();\n\t\n\tthis.mNeedSort = false;\n\tthis.mFrustrumCull = true;\n}","flush() {\n // trace(\"BatchRender flush \" + this.currentSize)\n if (this.currentSize === 0) {\n return;\n }\n var gl = this.renderer.gl;\n var MAX_TEXTURES = this.MAX_TEXTURES;\n var buffer = this.getAttributeBuffer(this.currentSize);\n // reveal(buffer);\n var indexBuffer = this.getIndexBuffer(this.currentIndexSize);\n // reveal(indexBuffer);\n var elements = this.elements;\n var groups = this.groups;\n var float32View = buffer.float32View;\n // reveal(float32View);\n var uint32View = buffer.uint32View;\n // reveal(uint32View);\n var touch = this.renderer.textureGC.count;\n var index = 0;\n var indexCount = 0;\n var nextTexture;\n var currentTexture;\n var groupCount = 0;\n var textureCount = 0;\n var currentGroup = groups[0];\n // reveal(currentGroup);\n var blendMode = -1; // premultiplyBlendMode[elements[0]._texture.baseTexture.premultiplyAlpha ? 0 : ][elements[0].blendMode];\n currentGroup.textureCount = 0;\n currentGroup.start = 0;\n currentGroup.blend = blendMode;\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\n var i;\n for (i = 0; i < this.currentIndex; ++i) {\n // upload the sprite elements...\n // they have all ready been calculated so we just need to push them into the buffer.\n var sprite = elements[i];\n elements[i] = null;\n nextTexture = sprite._texture.baseTexture;\n // reveal(nextTexture);\n var spriteBlendMode = BlendModesSettings_1.BlendModesSettings.premultiplyBlendMode[nextTexture.premultiplyAlpha ? 1 : 0][sprite.blendMode];\n if (blendMode !== spriteBlendMode) {\n blendMode = spriteBlendMode;\n // force the batch to break!\n currentTexture = null;\n textureCount = MAX_TEXTURES;\n TICK++;\n }\n if (currentTexture !== nextTexture) {\n currentTexture = nextTexture;\n if (nextTexture._batchEnabled !== TICK) {\n if (textureCount === MAX_TEXTURES) {\n TICK++;\n textureCount = 0;\n currentGroup.size = indexCount - currentGroup.start;\n currentGroup = groups[groupCount++];\n currentGroup.textureCount = 0;\n currentGroup.blend = blendMode;\n currentGroup.start = indexCount;\n }\n nextTexture.touched = touch;\n nextTexture._batchEnabled = TICK;\n nextTexture._id = textureCount;\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\n // reveal(currentGroup);\n // reveal(nextTexture);\n textureCount++;\n }\n }\n this.packGeometry(sprite, float32View, uint32View, indexBuffer, index, indexCount); // argb, nextTexture._id, float32View, uint32View, indexBuffer, index, indexCount);\n // HERE \n // push a graphics..\n index += (sprite.vertexData.length / 2) * this.vertSize;\n indexCount += sprite.indices.length;\n }\n BaseTexture_1.BaseTexture._globalBatch = TICK;\n currentGroup.size = indexCount - currentGroup.start;\n // this.indexBuffer.update();\n if (!WebGLSettings_1.WebGLSettings.CAN_UPLOAD_SAME_BUFFER) {\n // this is still needed for IOS performance..\n // it really does not like uploading to the same buffer in a single frame!\n if (this.vaoMax <= this.vertexCount) {\n this.vaoMax++;\n /* eslint-disable max-len */\n this.vaos[this.vertexCount] = new BatchGeometry_1.BatchGeometry();\n }\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\n // this.vertexBuffers[this.vertexCount].update(buffer.vertices, 0);\n this.renderer.geometry.bind(this.vaos[this.vertexCount]);\n this.renderer.geometry.updateBuffers();\n this.vertexCount++;\n }\n else {\n // lets use the faster option, always use buffer number 0\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\n // if (true)// this.spriteOnly)\n // {\n // this.vaos[this.vertexCount].indexBuffer = this.defualtSpriteIndexBuffer;\n // this.vaos[this.vertexCount].buffers[1] = this.defualtSpriteIndexBuffer;\n // }\n // this.vaos[0].attributes.aColor.stride = 24\n // this.vaos[0].attributes.aColor.start = 16\n // NOT SET\n // this.vaos[0].attributes.aTextureCoord.stride = 24\n // this.vaos[0].attributes.aTextureCoord.start = 8\n // NOT SET\n // this.vaos[0].attributes.aVertexPosition.stride = 24\n // NOT SET\n this.renderer.geometry.updateBuffers();\n // \n }\n // this.renderer.state.set(this.state);\n var textureSystem = this.renderer.texture;\n var stateSystem = this.renderer.state;\n // e.log(groupCount);\n // / render the groups..\n // trace(\"groupcount: \" + groupCount)\n // trace(\"BatchRenderer count: \" + groupCount)\n for (i = 0; i < groupCount; i++) {\n var group = groups[i];\n var groupTextureCount = group.textureCount;\n for (var j = 0; j < groupTextureCount; j++) {\n // trace(\"possible textureSystem bind call (BathRenderer)\")\n // trace(\"binding: \" + group.textures[j] + \" to \" + j)\n textureSystem.bind(group.textures[j], j);\n group.textures[j] = null;\n }\n // this.state.blendMode = group.blend;\n // this.state.blend = true;\n // this.renderer.state.setState(this.state);\n // set the blend mode..\n stateSystem.setBlendMode(group.blend);\n gl.drawElements(group.type, group.size, gl.UNSIGNED_SHORT, group.start * 2);\n }\n // reset elements for the next flush\n this.currentIndex = 0;\n this.currentSize = 0;\n this.currentIndexSize = 0;\n }","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\n var ancestors = parent\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\n : [];\n write(function () {\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\n },\n };\n}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\n var ancestors = parent\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\n : [];\n write(function () {\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\n },\n };\n}","function enqueueUpdate(component){ensureInjected();// Various parts of our code (such as ReactCompositeComponent's\n// _renderValidatedComponent) assume that calls to render aren't nested;\n// verify that that's the case. (This is called by each top-level update\n// function, like setState, forceUpdate, etc.; creation and\n// destruction of top-level components is guarded in ReactMount.)\nif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);if(component._updateBatchNumber==null){component._updateBatchNumber=updateBatchNumber+1;}}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n var order = Array.from(queue).sort(compareByDepth);\n if (parent) {\n withoutTreeTransform(parent, function () {\n batchResetAndMeasure(order);\n });\n }\n else {\n batchResetAndMeasure(order);\n }\n /**\n * Write: Notify the VisualElements they're ready for further write operations.\n */\n order.forEach(layoutReady);\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n flushSync.preRender();\n flushSync.render();\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n sync.postRender(function () { return order.forEach(assignProjectionToSnapshot); });\n queue.clear();\n },\n };\n}","buildDrawCalls() {\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\n for (var i = 0; i < this.drawCalls.length; i++) {\n this.drawCalls[i].textures.length = 0;\n GraphicsGeometry.DRAW_CALL_POOL.push(this.drawCalls[i]);\n }\n this.drawCalls.length = 0;\n var uvs = this.uvs;\n var colors = this.colors;\n var textureIds = this.textureIds;\n var currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\n currentGroup.textureCount = 0;\n currentGroup.start = 0;\n currentGroup.size = 0;\n currentGroup.type = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n var textureCount = 0;\n var currentTexture = null;\n var textureId = 0;\n var native = false;\n var drawMode = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n var index = 0;\n this.drawCalls.push(currentGroup);\n // TODO - this can be simplified\n for (var i$1 = 0; i$1 < this.batches.length; i$1++) {\n var data = this.batches[i$1];\n // TODO add some full on MAX_TEXTURE CODE..\n var MAX_TEXTURES = 8;\n var style = data.style;\n var nextTexture = style.texture.baseTexture;\n if (native !== style.native) {\n native = style.native;\n drawMode = native ? DrawModeSettings_1.DrawModeSettings.DRAW_MODES.LINES : DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\n // force the batch to break!\n currentTexture = null;\n textureCount = MAX_TEXTURES;\n TICK++;\n }\n if (currentTexture !== nextTexture) {\n currentTexture = nextTexture;\n if (nextTexture._batchEnabled !== TICK) {\n if (textureCount === MAX_TEXTURES) {\n TICK++;\n textureCount = 0;\n if (currentGroup.size > 0) {\n currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\n this.drawCalls.push(currentGroup);\n }\n currentGroup.start = index;\n currentGroup.size = 0;\n currentGroup.textureCount = 0;\n currentGroup.type = drawMode;\n }\n // TODO add this to the render part..\n nextTexture.touched = 1; // touch;\n nextTexture._batchEnabled = TICK;\n nextTexture._id = textureCount;\n nextTexture.wrapMode = 10497;\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\n textureCount++;\n }\n }\n currentGroup.size += data.size;\n index += data.size;\n textureId = nextTexture._id;\n this.addColors(colors, style.color, style.alpha, data.attribSize);\n this.addTextureIds(textureIds, textureId, data.attribSize);\n }\n BaseTexture_1.BaseTexture._globalBatch = TICK;\n // upload..\n // merge for now!\n var verts = this.points;\n // verts are 2 positions.. so we * by 3 as there are 6 properties.. then 4 cos its bytes\n var glPoints = new ArrayBuffer(verts.length * 3 * 4);\n var f32 = new Float32Array(glPoints);\n var u32 = new Uint32Array(glPoints);\n var p = 0;\n for (var i$2 = 0; i$2 < verts.length / 2; i$2++) {\n f32[p++] = verts[i$2 * 2];\n f32[p++] = verts[(i$2 * 2) + 1];\n f32[p++] = uvs[i$2 * 2];\n f32[p++] = uvs[(i$2 * 2) + 1];\n u32[p++] = colors[i$2];\n f32[p++] = textureIds[i$2];\n }\n this._buffer.update(glPoints);\n this._indexBuffer.update(this.indicesUint16);\n }","function u(e) {\n // Various parts of our code (such as ReactCompositeComponent's\n // _renderValidatedComponent) assume that calls to render aren't nested;\n // verify that that's the case. (This is called by each top-level update\n // function, like setState, forceUpdate, etc.; creation and\n // destruction of top-level components is guarded in ReactMount.)\n if (r(), !C.isBatchingUpdates) return void C.batchedUpdates(u, e);\n v.push(e), null == e._updateBatchNumber && (e._updateBatchNumber = y + 1);\n }","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\n globalState.inBatch++;\n}","function startBatch() {\r\n globalState.inBatch++;\r\n}","function batchedUpdates(fn, a) {\n\t var previousIsBatchingUpdates = isBatchingUpdates;\n\t isBatchingUpdates = true;\n\t try {\n\t return fn(a);\n\t } finally {\n\t isBatchingUpdates = previousIsBatchingUpdates;\n\t if (!isBatchingUpdates && !isRendering) {\n\t performWork(Sync, null);\n\t }\n\t }\n\t }","function addToBatchCache() {\n\t\t\n\t\tTHREE.WebGLBatchCompiler.batchCache.push( new THREE.WebGLBatchCompiler.batchCacheObject( geometry, materials, mesh.webGLBatches, mesh.webGLIsTransparent ));\n\t}","function createBatcher() {\n var queue = new Set();\n return {\n add: function (child) { return queue.add(child); },\n flush: function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\n batchLayout(function (read, write) {\n var order = Array.from(queue).sort(compareByDepth);\n var ancestors = parent\n ? collectProjectingAncestors(parent)\n : [];\n write(function () {\n var allElements = __spreadArray(__spreadArray([], __read(ancestors)), __read(order));\n allElements.forEach(function (element) { return element.resetTransform(); });\n });\n read(function () {\n order.forEach(updateLayoutMeasurement);\n });\n write(function () {\n ancestors.forEach(function (element) { return element.restoreTransform(); });\n order.forEach(layoutReady);\n });\n read(function () {\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n });\n write(function () {\n /**\n * Starting these animations will have queued jobs on the frame loop. In some situations,\n * like when removing an element, these will be processed too late after the DOM is manipulated,\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\n * we ensure there's no flash.\n */\n flushSync.preRender();\n flushSync.render();\n });\n read(function () {\n /**\n * Schedule a callback at the end of the following frame to assign the latest projection\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\n * child attempts to calculate its previous relative position against a prevViewportBox\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\n * render.\n */\n es.postRender(function () {\n return order.forEach(assignProjectionToSnapshot);\n });\n queue.clear();\n });\n });\n // TODO: Need to find a layout-synchronous way of flushing this\n flushLayout();\n },\n };\n}","updateRenderers_() {\n this.renderers = this.staticRenderers.concat(this.getDynamicRenderers()).sort(rendererPrioritySort);\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n }\n finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","render(delta, spriteBatch) {}","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function _startBatch() {\n ++_batch;\n }","function createBatcher() {\n var queue = new Set();\n var add = function (child) { return queue.add(child); };\n var flush = function (_a) {\n var _b = _a === void 0 ? defaultHandler : _a, measureLayout = _b.measureLayout, layoutReady = _b.layoutReady, parent = _b.parent;\n var order = Array.from(queue).sort(sortByDepth);\n var resetAndMeasure = function () {\n /**\n * Write: Reset any transforms on children elements so we can read their actual layout\n */\n order.forEach(function (child) { return child.resetTransform(); });\n /**\n * Read: Measure the actual layout\n */\n order.forEach(measureLayout);\n };\n parent ? parent.withoutTransform(resetAndMeasure) : resetAndMeasure();\n /**\n * Write: Notify the VisualElements they're ready for further write operations.\n */\n order.forEach(layoutReady);\n /**\n * After all children have started animating, ensure any Entering components are set to Present.\n * If we add deferred animations (set up all animations and then start them in two loops) this\n * could be moved to the start loop. But it needs to happen after all the animations configs\n * are generated in AnimateSharedLayout as this relies on presence data\n */\n order.forEach(function (child) {\n if (child.isPresent)\n child.presence = Presence.Present;\n });\n queue.clear();\n };\n return { add: add, flush: flush };\n}","function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\n\t// _renderValidatedComponent) assume that calls to render aren't nested;\n\t// verify that that's the case. (This is called by each top-level update\n\t// function, like setProps, setState, forceUpdate, etc.; creation and\n\t// destruction of top-level components is guarded in ReactMount.)\n\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}","function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\n\t// _renderValidatedComponent) assume that calls to render aren't nested;\n\t// verify that that's the case. (This is called by each top-level update\n\t// function, like setProps, setState, forceUpdate, etc.; creation and\n\t// destruction of top-level components is guarded in ReactMount.)\n\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function batchedUpdates(callback) {\n if (isBatchingUpdates) {\n // We're already executing in an environment where updates will be batched,\n // so this is a no-op.\n callback();\n return;\n }\n\n isBatchingUpdates = true;\n\n try {\n callback();\n // TODO: Sort components by depth such that parent components update first\n for (var i = 0; i < dirtyComponents.length; i++) {\n // If a component is unmounted before pending changes apply, ignore them\n // TODO: Queue unmounts in the same list to avoid this happening at all\n var component = dirtyComponents[i];\n if (component.isMounted()) {\n // If performUpdateIfNecessary happens to enqueue any new updates, we\n // shouldn't execute the callbacks until the next render happens, so\n // stash the callbacks first\n var callbacks = component._pendingCallbacks;\n component._pendingCallbacks = null;\n component.performUpdateIfNecessary();\n if (callbacks) {\n for (var j = 0; j < callbacks.length; j++) {\n callbacks[j].call(component);\n }\n }\n }\n }\n } catch (error) {\n // IE8 requires `catch` in order to use `finally`.\n throw error;\n } finally {\n dirtyComponents.length = 0;\n isBatchingUpdates = false;\n }\n}","function useBatchFrameState() {\n var _useState = (0,react__WEBPACK_IMPORTED_MODULE_1__.useState)({}),\n _useState2 = (0,_babel_runtime_helpers_esm_slicedToArray__WEBPACK_IMPORTED_MODULE_0__.default)(_useState, 2),\n forceUpdate = _useState2[1];\n\n var statesRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)([]);\n var destroyRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)(false);\n var walkingIndex = 0;\n var beforeFrameId = 0;\n (0,react__WEBPACK_IMPORTED_MODULE_1__.useEffect)(function () {\n return function () {\n destroyRef.current = true;\n };\n }, []);\n\n function createState(defaultValue) {\n var myIndex = walkingIndex;\n walkingIndex += 1; // Fill value if not exist yet\n\n if (statesRef.current.length < myIndex + 1) {\n statesRef.current[myIndex] = defaultValue;\n } // Return filled as `setState`\n\n\n var value = statesRef.current[myIndex];\n\n function setValue(val) {\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\n rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default.cancel(beforeFrameId); // Flush with batch\n\n beforeFrameId = (0,rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default)(function () {\n if (!destroyRef.current) {\n forceUpdate({});\n }\n });\n }\n\n return [value, setValue];\n }\n\n return createState;\n}","onRowsRerender() {\n this.scheduleDraw(true);\n }","rerender(temp, temp2, renderChunkBorder) {\r\n this.resizeOffscreenCanvas()\r\n //this.ctx.drawImage(Chunk.texture, 0,0, this.image.width, this.image.height);\r\n this.objects.forEach(obj => {\r\n obj.render(this);\r\n }); \r\n }","afterRender() { }","afterRender() { }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performWork(Sync, null);\n }\n }\n }","onBatchEnd() {\n this.logEventBatch(this.batchedEvents);\n const changeEvts = this.batchedEvents.filter((event) => event.isTreeChange);\n // TODO this is a bit spaghetti-ish, we should probably\n // have an event that fires and is listened to. This code shouldn't\n // know about the node tree.\n window.nodeTree.processTreeChanges(changeEvts);\n this.batchedEvents = [];\n }","function batchRenderer(itemPromise, recycled) {\n var element, label, item, img;\n if (!recycled) {\n // create a basic template for the item which doesn't depend on the data\n element = document.createElement(\"div\");\n element.className = \"itemTempl\";\n element.innerHTML = \"<div class='content'>...</div>\";\n }\n else {\n // clean up the recycled element so that we can re-use it rather than having\n // to create the html from scratch\n element = recycled;\n label = element.querySelector(\".content\");\n label.innerHTML = \"...\";\n // remove the image if its arealy there\n img = element.querySelector(\"img\");\n if (img) { element.removeChild(img); }\n }\n // return the element as the placeholder, and a callback to update it when data is available\n return {\n element: element,\n // specifies a promise that will be completed when rendering is complete\n // itemPromise will complete when the data is available\n renderComplete: itemPromise.then(function (i) {\n item = i;\n // mutate the element to update only the title\n if (!label) { label = element.querySelector(\".content\"); }\n label.innerText = item.data.title;\n // use the item.ready promise to delay the more expensive work\n return item.ready;\n // use the ability to chain promises, to enable work to be cancelled\n }).then(function () {\n //use the image loader to queue the loading of the image\n return item.loadImage(item.data.thumbnail);\n }).then(thumbnailBatch()\n ).then(function (newimg) {\n img = newimg;\n element.insertBefore(img, element.firstElementChild);\n return item.isOnScreen();\n }).then(function (onscreen) {\n if (!onscreen) {\n //if the item is not visible, then don't animate its opacity\n img.style.opacity = 1;\n } else {\n //if the item is visible then animate the opacity of the image\n WinJS.UI.Animation.fadeIn(img);\n }\n }).then(null, function (err) {\n //if an error occurs, and its not a cancellation, then show a placeholder\n if (err.name === \"Canceled\") {\n return WinJS.Promise.wrapError(err);\n } else {\n img = element.querySelector(\"img\");\n if (img) {\n img.src = \"/images/placeholder-sdk.png\";\n img.style.opacity = 1;\n }\n return;\n }\n })\n };\n }","updateMultiTexture() {\n\t\tthis.chunk.forEach(function(row, i, arr) {\n\t\t\trow.forEach(function(item, j, rarr) {\n\t\t\t\titem.updateMultiTexture();\n\t\t\t})\n\t\t});\n\t}","function batchedCallback(callback) {\n\treturn function(err, res) {\n\t\tReactUpdates.batchedUpdates(callback.bind(null, err, res));\n\t}\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n }","function useBatchFrameState() {\n var _useState = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useState\"])({}),\n _useState2 = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__babel_runtime_helpers_esm_slicedToArray__[\"a\" /* default */])(_useState, 2),\n forceUpdate = _useState2[1];\n\n var statesRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useRef\"])([]);\n var destroyRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useRef\"])(false);\n var walkingIndex = 0;\n var beforeFrameId = 0;\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\"useEffect\"])(function () {\n return function () {\n destroyRef.current = true;\n };\n }, []);\n\n function createState(defaultValue) {\n var myIndex = walkingIndex;\n walkingIndex += 1; // Fill value if not exist yet\n\n if (statesRef.current.length < myIndex + 1) {\n statesRef.current[myIndex] = defaultValue;\n } // Return filled as `setState`\n\n\n var value = statesRef.current[myIndex];\n\n function setValue(val) {\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\n __WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\"a\" /* default */].cancel(beforeFrameId); // Flush with batch\n\n beforeFrameId = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\"a\" /* default */])(function () {\n if (!destroyRef.current) {\n forceUpdate({});\n }\n });\n }\n\n return [value, setValue];\n }\n\n return createState;\n}","_renderBuffers() {\n let buffers = this._bufferData;\n this._buffers.clearLayers();\n if (!buffers) return;\n\n buffers.features.forEach((feature) => {\n if (this._state[feature.properties.id]) {\n this._buffers.addData(feature);\n }\n }, this);\n }","renderInsidePatch() {\n\t\tif (this.component_.wasRendered && !this.shouldUpdate(this.changes_)) {\n\t\t\tthis.skipRerender_();\n\t\t\treturn;\n\t\t}\n\t\tthis.renderInsidePatchDontSkip_();\n\t}","flush() {\n this._renderer.flush();\n }","function MultiRenderer()\n{\n this._views = [];\n}","function batchedUpdates(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = !0;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates, isBatchingUpdates || isRendering || performWork(Sync$1, null);\n }\n }","function rerenderall() {\n console.log(\"Step 4\");\n rerenderElements(\"runs\");\n rerenderElements(\"configs\");\n rerenderElements(\"evals\");\n rerenderElements(\"locations\");\n}","myRenderer (api, rowIdx) {\n\n\t}","postrender() {\n this.gl.flush();\n }","function enqueueUpdate(component) {\n\t\t ensureInjected();\n\t\t\n\t\t // Various parts of our code (such as ReactCompositeComponent's\n\t\t // _renderValidatedComponent) assume that calls to render aren't nested;\n\t\t // verify that that's the case. (This is called by each top-level update\n\t\t // function, like setState, forceUpdate, etc.; creation and\n\t\t // destruction of top-level components is guarded in ReactMount.)\n\t\t\n\t\t if (!batchingStrategy.isBatchingUpdates) {\n\t\t batchingStrategy.batchedUpdates(enqueueUpdate, component);\n\t\t return;\n\t\t }\n\t\t\n\t\t dirtyComponents.push(component);\n\t\t if (component._updateBatchNumber == null) {\n\t\t component._updateBatchNumber = updateBatchNumber + 1;\n\t\t }\n\t\t}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}","function batchedUpdates$1(fn, a) {\n var previousIsBatchingUpdates = isBatchingUpdates;\n isBatchingUpdates = true;\n try {\n return fn(a);\n } finally {\n isBatchingUpdates = previousIsBatchingUpdates;\n if (!isBatchingUpdates && !isRendering) {\n performSyncWork();\n }\n }\n}"],"string":"[\n \"updateBatches() {\\n if (this.dirty === this.cacheDirty) {\\n return;\\n }\\n if (this.graphicsData.length === 0) {\\n return;\\n }\\n if (this.dirty !== this.cacheDirty) {\\n for (var i = 0; i < this.graphicsData.length; i++) {\\n var data = this.graphicsData[i];\\n // reveal(data.fillStyle.texture.baseTexture.resource);\\n // reveal(data.lineStyle.texture.baseTexture.resource);\\n if (data.fillStyle && !data.fillStyle.texture.baseTexture.valid) {\\n return;\\n }\\n if (data.lineStyle && !data.lineStyle.texture.baseTexture.valid) {\\n return;\\n }\\n }\\n }\\n this.cacheDirty = this.dirty;\\n var uvs = this.uvs;\\n var batchPart = this.batches.pop()\\n || GraphicsGeometry.BATCH_POOL.pop()\\n || new BatchPart();\\n batchPart.style = batchPart.style\\n || this.graphicsData[0].fillStyle\\n || this.graphicsData[0].lineStyle;\\n var currentTexture = batchPart.style.texture.baseTexture;\\n // reveal(currentTexture);\\n var currentColor = batchPart.style.color + batchPart.style.alpha;\\n this.batches.push(batchPart);\\n // reveal(this.batches);\\n // TODO - this can be simplified\\n for (var i$1 = this.shapeIndex; i$1 < this.graphicsData.length; i$1++) {\\n this.shapeIndex++;\\n var data$1 = this.graphicsData[i$1];\\n // reveal(data$1);\\n var command = GraphicsGeometry.getFillCommand(data$1.type);\\n // reveal(command)\\n var fillStyle = data$1.fillStyle;\\n var lineStyle = data$1.lineStyle;\\n // build out the shapes points..\\n command.build(data$1);\\n if (data$1.matrix) {\\n this.transformPoints(data$1.points, data$1.matrix);\\n // reveal(data$1.points)\\n // \\treveal(data$1.matrix)\\n }\\n for (var j = 0; j < 2; j++) {\\n var style = (j === 0) ? fillStyle : lineStyle;\\n if (!style.visible) {\\n continue;\\n }\\n var nextTexture = style.texture.baseTexture;\\n if (currentTexture !== nextTexture || (style.color + style.alpha) !== currentColor) {\\n // TODO use a const\\n nextTexture.wrapMode = 10497;\\n currentTexture = nextTexture;\\n currentColor = style.color + style.alpha;\\n var index$1 = this.indices.length;\\n var attribIndex = this.points.length / 2;\\n batchPart.size = index$1 - batchPart.start;\\n batchPart.attribSize = attribIndex - batchPart.attribStart;\\n if (batchPart.size > 0) {\\n batchPart = GraphicsGeometry.BATCH_POOL.pop() || new BatchPart();\\n this.batches.push(batchPart);\\n }\\n batchPart.style = style;\\n batchPart.start = index$1;\\n batchPart.attribStart = attribIndex;\\n // TODO add this to the render part..\\n }\\n var start = this.points.length / 2;\\n if (j === 0) {\\n if (data$1.holes.length) {\\n this.processHoles(data$1.holes);\\n GraphicsGeometry.buildPoly.triangulate(data$1, this);\\n }\\n else {\\n command.triangulate(data$1, this);\\n }\\n }\\n else {\\n GraphicsGeometry.buildLine(data$1, this);\\n for (var i$2 = 0; i$2 < data$1.holes.length; i$2++) {\\n GraphicsGeometry.buildLine(data$1.holes[i$2], this);\\n }\\n }\\n var size = (this.points.length / 2) - start;\\n this.addUvs(this.points, uvs, style.texture, start, size, style.matrix);\\n }\\n }\\n var index = this.indices.length;\\n var attrib = this.points.length / 2;\\n batchPart.size = index - batchPart.start;\\n batchPart.attribSize = attrib - batchPart.attribStart;\\n this.indicesUint16 = new Uint16Array(this.indices);\\n // TODO make this a const..\\n this.batchable = this.isBatchable();\\n if (this.batchable) {\\n this.batchDirty++;\\n this.uvsFloat32 = new Float32Array(this.uvs);\\n // offset the indices so that it works with the batcher...\\n for (var i$3 = 0; i$3 < this.batches.length; i$3++) {\\n var batch = this.batches[i$3];\\n for (var j$1 = 0; j$1 < batch.size; j$1++) {\\n var index$2 = batch.start + j$1;\\n this.indicesUint16[index$2] = this.indicesUint16[index$2] - batch.attribStart;\\n }\\n }\\n }\\n else {\\n this.buildDrawCalls();\\n }\\n }\",\n \"function RenderBatch() {\\n\\tthis.mRenderData = new Array();\\n\\t\\n\\tthis.mNeedSort = false;\\n\\tthis.mFrustrumCull = true;\\n}\",\n \"flush() {\\n // trace(\\\"BatchRender flush \\\" + this.currentSize)\\n if (this.currentSize === 0) {\\n return;\\n }\\n var gl = this.renderer.gl;\\n var MAX_TEXTURES = this.MAX_TEXTURES;\\n var buffer = this.getAttributeBuffer(this.currentSize);\\n // reveal(buffer);\\n var indexBuffer = this.getIndexBuffer(this.currentIndexSize);\\n // reveal(indexBuffer);\\n var elements = this.elements;\\n var groups = this.groups;\\n var float32View = buffer.float32View;\\n // reveal(float32View);\\n var uint32View = buffer.uint32View;\\n // reveal(uint32View);\\n var touch = this.renderer.textureGC.count;\\n var index = 0;\\n var indexCount = 0;\\n var nextTexture;\\n var currentTexture;\\n var groupCount = 0;\\n var textureCount = 0;\\n var currentGroup = groups[0];\\n // reveal(currentGroup);\\n var blendMode = -1; // premultiplyBlendMode[elements[0]._texture.baseTexture.premultiplyAlpha ? 0 : ][elements[0].blendMode];\\n currentGroup.textureCount = 0;\\n currentGroup.start = 0;\\n currentGroup.blend = blendMode;\\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\\n var i;\\n for (i = 0; i < this.currentIndex; ++i) {\\n // upload the sprite elements...\\n // they have all ready been calculated so we just need to push them into the buffer.\\n var sprite = elements[i];\\n elements[i] = null;\\n nextTexture = sprite._texture.baseTexture;\\n // reveal(nextTexture);\\n var spriteBlendMode = BlendModesSettings_1.BlendModesSettings.premultiplyBlendMode[nextTexture.premultiplyAlpha ? 1 : 0][sprite.blendMode];\\n if (blendMode !== spriteBlendMode) {\\n blendMode = spriteBlendMode;\\n // force the batch to break!\\n currentTexture = null;\\n textureCount = MAX_TEXTURES;\\n TICK++;\\n }\\n if (currentTexture !== nextTexture) {\\n currentTexture = nextTexture;\\n if (nextTexture._batchEnabled !== TICK) {\\n if (textureCount === MAX_TEXTURES) {\\n TICK++;\\n textureCount = 0;\\n currentGroup.size = indexCount - currentGroup.start;\\n currentGroup = groups[groupCount++];\\n currentGroup.textureCount = 0;\\n currentGroup.blend = blendMode;\\n currentGroup.start = indexCount;\\n }\\n nextTexture.touched = touch;\\n nextTexture._batchEnabled = TICK;\\n nextTexture._id = textureCount;\\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\\n // reveal(currentGroup);\\n // reveal(nextTexture);\\n textureCount++;\\n }\\n }\\n this.packGeometry(sprite, float32View, uint32View, indexBuffer, index, indexCount); // argb, nextTexture._id, float32View, uint32View, indexBuffer, index, indexCount);\\n // HERE \\n // push a graphics..\\n index += (sprite.vertexData.length / 2) * this.vertSize;\\n indexCount += sprite.indices.length;\\n }\\n BaseTexture_1.BaseTexture._globalBatch = TICK;\\n currentGroup.size = indexCount - currentGroup.start;\\n // this.indexBuffer.update();\\n if (!WebGLSettings_1.WebGLSettings.CAN_UPLOAD_SAME_BUFFER) {\\n // this is still needed for IOS performance..\\n // it really does not like uploading to the same buffer in a single frame!\\n if (this.vaoMax <= this.vertexCount) {\\n this.vaoMax++;\\n /* eslint-disable max-len */\\n this.vaos[this.vertexCount] = new BatchGeometry_1.BatchGeometry();\\n }\\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\\n // this.vertexBuffers[this.vertexCount].update(buffer.vertices, 0);\\n this.renderer.geometry.bind(this.vaos[this.vertexCount]);\\n this.renderer.geometry.updateBuffers();\\n this.vertexCount++;\\n }\\n else {\\n // lets use the faster option, always use buffer number 0\\n this.vaos[this.vertexCount]._buffer.update(buffer.vertices, 0);\\n this.vaos[this.vertexCount]._indexBuffer.update(indexBuffer, 0);\\n // if (true)// this.spriteOnly)\\n // {\\n // this.vaos[this.vertexCount].indexBuffer = this.defualtSpriteIndexBuffer;\\n // this.vaos[this.vertexCount].buffers[1] = this.defualtSpriteIndexBuffer;\\n // }\\n // this.vaos[0].attributes.aColor.stride = 24\\n // this.vaos[0].attributes.aColor.start = 16\\n // NOT SET\\n // this.vaos[0].attributes.aTextureCoord.stride = 24\\n // this.vaos[0].attributes.aTextureCoord.start = 8\\n // NOT SET\\n // this.vaos[0].attributes.aVertexPosition.stride = 24\\n // NOT SET\\n this.renderer.geometry.updateBuffers();\\n // \\n }\\n // this.renderer.state.set(this.state);\\n var textureSystem = this.renderer.texture;\\n var stateSystem = this.renderer.state;\\n // e.log(groupCount);\\n // / render the groups..\\n // trace(\\\"groupcount: \\\" + groupCount)\\n // trace(\\\"BatchRenderer count: \\\" + groupCount)\\n for (i = 0; i < groupCount; i++) {\\n var group = groups[i];\\n var groupTextureCount = group.textureCount;\\n for (var j = 0; j < groupTextureCount; j++) {\\n // trace(\\\"possible textureSystem bind call (BathRenderer)\\\")\\n // trace(\\\"binding: \\\" + group.textures[j] + \\\" to \\\" + j)\\n textureSystem.bind(group.textures[j], j);\\n group.textures[j] = null;\\n }\\n // this.state.blendMode = group.blend;\\n // this.state.blend = true;\\n // this.renderer.state.setState(this.state);\\n // set the blend mode..\\n stateSystem.setBlendMode(group.blend);\\n gl.drawElements(group.type, group.size, gl.UNSIGNED_SHORT, group.start * 2);\\n }\\n // reset elements for the next flush\\n this.currentIndex = 0;\\n this.currentSize = 0;\\n this.currentIndexSize = 0;\\n }\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\\n var ancestors = parent\\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\\n : [];\\n write(function () {\\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\\n },\\n };\\n}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.batchLayout)(function (read, write) {\\n var order = Array.from(queue).sort(_render_utils_compare_by_depth_js__WEBPACK_IMPORTED_MODULE_2__.compareByDepth);\\n var ancestors = parent\\n ? (0,_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.collectProjectingAncestors)(parent)\\n : [];\\n write(function () {\\n var allElements = (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)((0,tslib__WEBPACK_IMPORTED_MODULE_4__.__spreadArray)([], (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(ancestors)), (0,tslib__WEBPACK_IMPORTED_MODULE_4__.__read)(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(_render_dom_projection_utils_js__WEBPACK_IMPORTED_MODULE_3__.updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = _types_js__WEBPACK_IMPORTED_MODULE_5__.Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.preRender();\\n framesync__WEBPACK_IMPORTED_MODULE_0__.flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n framesync__WEBPACK_IMPORTED_MODULE_0__.default.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n (0,_render_dom_utils_batch_layout_js__WEBPACK_IMPORTED_MODULE_1__.flushLayout)();\\n },\\n };\\n}\",\n \"function enqueueUpdate(component){ensureInjected();// Various parts of our code (such as ReactCompositeComponent's\\n// _renderValidatedComponent) assume that calls to render aren't nested;\\n// verify that that's the case. (This is called by each top-level update\\n// function, like setState, forceUpdate, etc.; creation and\\n// destruction of top-level components is guarded in ReactMount.)\\nif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);if(component._updateBatchNumber==null){component._updateBatchNumber=updateBatchNumber+1;}}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n var order = Array.from(queue).sort(compareByDepth);\\n if (parent) {\\n withoutTreeTransform(parent, function () {\\n batchResetAndMeasure(order);\\n });\\n }\\n else {\\n batchResetAndMeasure(order);\\n }\\n /**\\n * Write: Notify the VisualElements they're ready for further write operations.\\n */\\n order.forEach(layoutReady);\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n flushSync.preRender();\\n flushSync.render();\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n sync.postRender(function () { return order.forEach(assignProjectionToSnapshot); });\\n queue.clear();\\n },\\n };\\n}\",\n \"buildDrawCalls() {\\n var TICK = ++BaseTexture_1.BaseTexture._globalBatch;\\n for (var i = 0; i < this.drawCalls.length; i++) {\\n this.drawCalls[i].textures.length = 0;\\n GraphicsGeometry.DRAW_CALL_POOL.push(this.drawCalls[i]);\\n }\\n this.drawCalls.length = 0;\\n var uvs = this.uvs;\\n var colors = this.colors;\\n var textureIds = this.textureIds;\\n var currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\\n currentGroup.textureCount = 0;\\n currentGroup.start = 0;\\n currentGroup.size = 0;\\n currentGroup.type = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n var textureCount = 0;\\n var currentTexture = null;\\n var textureId = 0;\\n var native = false;\\n var drawMode = DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n var index = 0;\\n this.drawCalls.push(currentGroup);\\n // TODO - this can be simplified\\n for (var i$1 = 0; i$1 < this.batches.length; i$1++) {\\n var data = this.batches[i$1];\\n // TODO add some full on MAX_TEXTURE CODE..\\n var MAX_TEXTURES = 8;\\n var style = data.style;\\n var nextTexture = style.texture.baseTexture;\\n if (native !== style.native) {\\n native = style.native;\\n drawMode = native ? DrawModeSettings_1.DrawModeSettings.DRAW_MODES.LINES : DrawModeSettings_1.DrawModeSettings.DRAW_MODES.TRIANGLES;\\n // force the batch to break!\\n currentTexture = null;\\n textureCount = MAX_TEXTURES;\\n TICK++;\\n }\\n if (currentTexture !== nextTexture) {\\n currentTexture = nextTexture;\\n if (nextTexture._batchEnabled !== TICK) {\\n if (textureCount === MAX_TEXTURES) {\\n TICK++;\\n textureCount = 0;\\n if (currentGroup.size > 0) {\\n currentGroup = GraphicsGeometry.DRAW_CALL_POOL.pop() || new BatchDrawCall_1.BatchDrawCall();\\n this.drawCalls.push(currentGroup);\\n }\\n currentGroup.start = index;\\n currentGroup.size = 0;\\n currentGroup.textureCount = 0;\\n currentGroup.type = drawMode;\\n }\\n // TODO add this to the render part..\\n nextTexture.touched = 1; // touch;\\n nextTexture._batchEnabled = TICK;\\n nextTexture._id = textureCount;\\n nextTexture.wrapMode = 10497;\\n currentGroup.textures[currentGroup.textureCount++] = nextTexture;\\n textureCount++;\\n }\\n }\\n currentGroup.size += data.size;\\n index += data.size;\\n textureId = nextTexture._id;\\n this.addColors(colors, style.color, style.alpha, data.attribSize);\\n this.addTextureIds(textureIds, textureId, data.attribSize);\\n }\\n BaseTexture_1.BaseTexture._globalBatch = TICK;\\n // upload..\\n // merge for now!\\n var verts = this.points;\\n // verts are 2 positions.. so we * by 3 as there are 6 properties.. then 4 cos its bytes\\n var glPoints = new ArrayBuffer(verts.length * 3 * 4);\\n var f32 = new Float32Array(glPoints);\\n var u32 = new Uint32Array(glPoints);\\n var p = 0;\\n for (var i$2 = 0; i$2 < verts.length / 2; i$2++) {\\n f32[p++] = verts[i$2 * 2];\\n f32[p++] = verts[(i$2 * 2) + 1];\\n f32[p++] = uvs[i$2 * 2];\\n f32[p++] = uvs[(i$2 * 2) + 1];\\n u32[p++] = colors[i$2];\\n f32[p++] = textureIds[i$2];\\n }\\n this._buffer.update(glPoints);\\n this._indexBuffer.update(this.indicesUint16);\\n }\",\n \"function u(e) {\\n // Various parts of our code (such as ReactCompositeComponent's\\n // _renderValidatedComponent) assume that calls to render aren't nested;\\n // verify that that's the case. (This is called by each top-level update\\n // function, like setState, forceUpdate, etc.; creation and\\n // destruction of top-level components is guarded in ReactMount.)\\n if (r(), !C.isBatchingUpdates) return void C.batchedUpdates(u, e);\\n v.push(e), null == e._updateBatchNumber && (e._updateBatchNumber = y + 1);\\n }\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\n globalState.inBatch++;\\n}\",\n \"function startBatch() {\\r\\n globalState.inBatch++;\\r\\n}\",\n \"function batchedUpdates(fn, a) {\\n\\t var previousIsBatchingUpdates = isBatchingUpdates;\\n\\t isBatchingUpdates = true;\\n\\t try {\\n\\t return fn(a);\\n\\t } finally {\\n\\t isBatchingUpdates = previousIsBatchingUpdates;\\n\\t if (!isBatchingUpdates && !isRendering) {\\n\\t performWork(Sync, null);\\n\\t }\\n\\t }\\n\\t }\",\n \"function addToBatchCache() {\\n\\t\\t\\n\\t\\tTHREE.WebGLBatchCompiler.batchCache.push( new THREE.WebGLBatchCompiler.batchCacheObject( geometry, materials, mesh.webGLBatches, mesh.webGLIsTransparent ));\\n\\t}\",\n \"function createBatcher() {\\n var queue = new Set();\\n return {\\n add: function (child) { return queue.add(child); },\\n flush: function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, layoutReady = _b.layoutReady, parent = _b.parent;\\n batchLayout(function (read, write) {\\n var order = Array.from(queue).sort(compareByDepth);\\n var ancestors = parent\\n ? collectProjectingAncestors(parent)\\n : [];\\n write(function () {\\n var allElements = __spreadArray(__spreadArray([], __read(ancestors)), __read(order));\\n allElements.forEach(function (element) { return element.resetTransform(); });\\n });\\n read(function () {\\n order.forEach(updateLayoutMeasurement);\\n });\\n write(function () {\\n ancestors.forEach(function (element) { return element.restoreTransform(); });\\n order.forEach(layoutReady);\\n });\\n read(function () {\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n });\\n write(function () {\\n /**\\n * Starting these animations will have queued jobs on the frame loop. In some situations,\\n * like when removing an element, these will be processed too late after the DOM is manipulated,\\n * leaving a flash of incorrectly-projected content. By manually flushing these jobs\\n * we ensure there's no flash.\\n */\\n flushSync.preRender();\\n flushSync.render();\\n });\\n read(function () {\\n /**\\n * Schedule a callback at the end of the following frame to assign the latest projection\\n * box to the prevViewportBox snapshot. Once global batching is in place this could be run\\n * synchronously. But for now it ensures that if any nested `AnimateSharedLayout` top-level\\n * child attempts to calculate its previous relative position against a prevViewportBox\\n * it will be against its latest projection box instead, as the snapshot is useless beyond this\\n * render.\\n */\\n es.postRender(function () {\\n return order.forEach(assignProjectionToSnapshot);\\n });\\n queue.clear();\\n });\\n });\\n // TODO: Need to find a layout-synchronous way of flushing this\\n flushLayout();\\n },\\n };\\n}\",\n \"updateRenderers_() {\\n this.renderers = this.staticRenderers.concat(this.getDynamicRenderers()).sort(rendererPrioritySort);\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n }\\n finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"render(delta, spriteBatch) {}\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function _startBatch() {\\n ++_batch;\\n }\",\n \"function createBatcher() {\\n var queue = new Set();\\n var add = function (child) { return queue.add(child); };\\n var flush = function (_a) {\\n var _b = _a === void 0 ? defaultHandler : _a, measureLayout = _b.measureLayout, layoutReady = _b.layoutReady, parent = _b.parent;\\n var order = Array.from(queue).sort(sortByDepth);\\n var resetAndMeasure = function () {\\n /**\\n * Write: Reset any transforms on children elements so we can read their actual layout\\n */\\n order.forEach(function (child) { return child.resetTransform(); });\\n /**\\n * Read: Measure the actual layout\\n */\\n order.forEach(measureLayout);\\n };\\n parent ? parent.withoutTransform(resetAndMeasure) : resetAndMeasure();\\n /**\\n * Write: Notify the VisualElements they're ready for further write operations.\\n */\\n order.forEach(layoutReady);\\n /**\\n * After all children have started animating, ensure any Entering components are set to Present.\\n * If we add deferred animations (set up all animations and then start them in two loops) this\\n * could be moved to the start loop. But it needs to happen after all the animations configs\\n * are generated in AnimateSharedLayout as this relies on presence data\\n */\\n order.forEach(function (child) {\\n if (child.isPresent)\\n child.presence = Presence.Present;\\n });\\n queue.clear();\\n };\\n return { add: add, flush: flush };\\n}\",\n \"function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\\n\\t// _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t// verify that that's the case. (This is called by each top-level update\\n\\t// function, like setProps, setState, forceUpdate, etc.; creation and\\n\\t// destruction of top-level components is guarded in ReactMount.)\\n\\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}\",\n \"function enqueueUpdate(component){ensureInjected(); // Various parts of our code (such as ReactCompositeComponent's\\n\\t// _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t// verify that that's the case. (This is called by each top-level update\\n\\t// function, like setProps, setState, forceUpdate, etc.; creation and\\n\\t// destruction of top-level components is guarded in ReactMount.)\\n\\tif(!batchingStrategy.isBatchingUpdates){batchingStrategy.batchedUpdates(enqueueUpdate,component);return;}dirtyComponents.push(component);}\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function batchedUpdates(callback) {\\n if (isBatchingUpdates) {\\n // We're already executing in an environment where updates will be batched,\\n // so this is a no-op.\\n callback();\\n return;\\n }\\n\\n isBatchingUpdates = true;\\n\\n try {\\n callback();\\n // TODO: Sort components by depth such that parent components update first\\n for (var i = 0; i < dirtyComponents.length; i++) {\\n // If a component is unmounted before pending changes apply, ignore them\\n // TODO: Queue unmounts in the same list to avoid this happening at all\\n var component = dirtyComponents[i];\\n if (component.isMounted()) {\\n // If performUpdateIfNecessary happens to enqueue any new updates, we\\n // shouldn't execute the callbacks until the next render happens, so\\n // stash the callbacks first\\n var callbacks = component._pendingCallbacks;\\n component._pendingCallbacks = null;\\n component.performUpdateIfNecessary();\\n if (callbacks) {\\n for (var j = 0; j < callbacks.length; j++) {\\n callbacks[j].call(component);\\n }\\n }\\n }\\n }\\n } catch (error) {\\n // IE8 requires `catch` in order to use `finally`.\\n throw error;\\n } finally {\\n dirtyComponents.length = 0;\\n isBatchingUpdates = false;\\n }\\n}\",\n \"function useBatchFrameState() {\\n var _useState = (0,react__WEBPACK_IMPORTED_MODULE_1__.useState)({}),\\n _useState2 = (0,_babel_runtime_helpers_esm_slicedToArray__WEBPACK_IMPORTED_MODULE_0__.default)(_useState, 2),\\n forceUpdate = _useState2[1];\\n\\n var statesRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)([]);\\n var destroyRef = (0,react__WEBPACK_IMPORTED_MODULE_1__.useRef)(false);\\n var walkingIndex = 0;\\n var beforeFrameId = 0;\\n (0,react__WEBPACK_IMPORTED_MODULE_1__.useEffect)(function () {\\n return function () {\\n destroyRef.current = true;\\n };\\n }, []);\\n\\n function createState(defaultValue) {\\n var myIndex = walkingIndex;\\n walkingIndex += 1; // Fill value if not exist yet\\n\\n if (statesRef.current.length < myIndex + 1) {\\n statesRef.current[myIndex] = defaultValue;\\n } // Return filled as `setState`\\n\\n\\n var value = statesRef.current[myIndex];\\n\\n function setValue(val) {\\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\\n rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default.cancel(beforeFrameId); // Flush with batch\\n\\n beforeFrameId = (0,rc_util_es_raf__WEBPACK_IMPORTED_MODULE_2__.default)(function () {\\n if (!destroyRef.current) {\\n forceUpdate({});\\n }\\n });\\n }\\n\\n return [value, setValue];\\n }\\n\\n return createState;\\n}\",\n \"onRowsRerender() {\\n this.scheduleDraw(true);\\n }\",\n \"rerender(temp, temp2, renderChunkBorder) {\\r\\n this.resizeOffscreenCanvas()\\r\\n //this.ctx.drawImage(Chunk.texture, 0,0, this.image.width, this.image.height);\\r\\n this.objects.forEach(obj => {\\r\\n obj.render(this);\\r\\n }); \\r\\n }\",\n \"afterRender() { }\",\n \"afterRender() { }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performWork(Sync, null);\\n }\\n }\\n }\",\n \"onBatchEnd() {\\n this.logEventBatch(this.batchedEvents);\\n const changeEvts = this.batchedEvents.filter((event) => event.isTreeChange);\\n // TODO this is a bit spaghetti-ish, we should probably\\n // have an event that fires and is listened to. This code shouldn't\\n // know about the node tree.\\n window.nodeTree.processTreeChanges(changeEvts);\\n this.batchedEvents = [];\\n }\",\n \"function batchRenderer(itemPromise, recycled) {\\n var element, label, item, img;\\n if (!recycled) {\\n // create a basic template for the item which doesn't depend on the data\\n element = document.createElement(\\\"div\\\");\\n element.className = \\\"itemTempl\\\";\\n element.innerHTML = \\\"<div class='content'>...</div>\\\";\\n }\\n else {\\n // clean up the recycled element so that we can re-use it rather than having\\n // to create the html from scratch\\n element = recycled;\\n label = element.querySelector(\\\".content\\\");\\n label.innerHTML = \\\"...\\\";\\n // remove the image if its arealy there\\n img = element.querySelector(\\\"img\\\");\\n if (img) { element.removeChild(img); }\\n }\\n // return the element as the placeholder, and a callback to update it when data is available\\n return {\\n element: element,\\n // specifies a promise that will be completed when rendering is complete\\n // itemPromise will complete when the data is available\\n renderComplete: itemPromise.then(function (i) {\\n item = i;\\n // mutate the element to update only the title\\n if (!label) { label = element.querySelector(\\\".content\\\"); }\\n label.innerText = item.data.title;\\n // use the item.ready promise to delay the more expensive work\\n return item.ready;\\n // use the ability to chain promises, to enable work to be cancelled\\n }).then(function () {\\n //use the image loader to queue the loading of the image\\n return item.loadImage(item.data.thumbnail);\\n }).then(thumbnailBatch()\\n ).then(function (newimg) {\\n img = newimg;\\n element.insertBefore(img, element.firstElementChild);\\n return item.isOnScreen();\\n }).then(function (onscreen) {\\n if (!onscreen) {\\n //if the item is not visible, then don't animate its opacity\\n img.style.opacity = 1;\\n } else {\\n //if the item is visible then animate the opacity of the image\\n WinJS.UI.Animation.fadeIn(img);\\n }\\n }).then(null, function (err) {\\n //if an error occurs, and its not a cancellation, then show a placeholder\\n if (err.name === \\\"Canceled\\\") {\\n return WinJS.Promise.wrapError(err);\\n } else {\\n img = element.querySelector(\\\"img\\\");\\n if (img) {\\n img.src = \\\"/images/placeholder-sdk.png\\\";\\n img.style.opacity = 1;\\n }\\n return;\\n }\\n })\\n };\\n }\",\n \"updateMultiTexture() {\\n\\t\\tthis.chunk.forEach(function(row, i, arr) {\\n\\t\\t\\trow.forEach(function(item, j, rarr) {\\n\\t\\t\\t\\titem.updateMultiTexture();\\n\\t\\t\\t})\\n\\t\\t});\\n\\t}\",\n \"function batchedCallback(callback) {\\n\\treturn function(err, res) {\\n\\t\\tReactUpdates.batchedUpdates(callback.bind(null, err, res));\\n\\t}\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n }\",\n \"function useBatchFrameState() {\\n var _useState = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useState\\\"])({}),\\n _useState2 = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_0__babel_runtime_helpers_esm_slicedToArray__[\\\"a\\\" /* default */])(_useState, 2),\\n forceUpdate = _useState2[1];\\n\\n var statesRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useRef\\\"])([]);\\n var destroyRef = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useRef\\\"])(false);\\n var walkingIndex = 0;\\n var beforeFrameId = 0;\\n __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_1_react__[\\\"useEffect\\\"])(function () {\\n return function () {\\n destroyRef.current = true;\\n };\\n }, []);\\n\\n function createState(defaultValue) {\\n var myIndex = walkingIndex;\\n walkingIndex += 1; // Fill value if not exist yet\\n\\n if (statesRef.current.length < myIndex + 1) {\\n statesRef.current[myIndex] = defaultValue;\\n } // Return filled as `setState`\\n\\n\\n var value = statesRef.current[myIndex];\\n\\n function setValue(val) {\\n statesRef.current[myIndex] = typeof val === 'function' ? val(statesRef.current[myIndex]) : val;\\n __WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\\\"a\\\" /* default */].cancel(beforeFrameId); // Flush with batch\\n\\n beforeFrameId = __webpack_require__.i(__WEBPACK_IMPORTED_MODULE_2_rc_util_es_raf__[\\\"a\\\" /* default */])(function () {\\n if (!destroyRef.current) {\\n forceUpdate({});\\n }\\n });\\n }\\n\\n return [value, setValue];\\n }\\n\\n return createState;\\n}\",\n \"_renderBuffers() {\\n let buffers = this._bufferData;\\n this._buffers.clearLayers();\\n if (!buffers) return;\\n\\n buffers.features.forEach((feature) => {\\n if (this._state[feature.properties.id]) {\\n this._buffers.addData(feature);\\n }\\n }, this);\\n }\",\n \"renderInsidePatch() {\\n\\t\\tif (this.component_.wasRendered && !this.shouldUpdate(this.changes_)) {\\n\\t\\t\\tthis.skipRerender_();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tthis.renderInsidePatchDontSkip_();\\n\\t}\",\n \"flush() {\\n this._renderer.flush();\\n }\",\n \"function MultiRenderer()\\n{\\n this._views = [];\\n}\",\n \"function batchedUpdates(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = !0;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates, isBatchingUpdates || isRendering || performWork(Sync$1, null);\\n }\\n }\",\n \"function rerenderall() {\\n console.log(\\\"Step 4\\\");\\n rerenderElements(\\\"runs\\\");\\n rerenderElements(\\\"configs\\\");\\n rerenderElements(\\\"evals\\\");\\n rerenderElements(\\\"locations\\\");\\n}\",\n \"myRenderer (api, rowIdx) {\\n\\n\\t}\",\n \"postrender() {\\n this.gl.flush();\\n }\",\n \"function enqueueUpdate(component) {\\n\\t\\t ensureInjected();\\n\\t\\t\\n\\t\\t // Various parts of our code (such as ReactCompositeComponent's\\n\\t\\t // _renderValidatedComponent) assume that calls to render aren't nested;\\n\\t\\t // verify that that's the case. (This is called by each top-level update\\n\\t\\t // function, like setState, forceUpdate, etc.; creation and\\n\\t\\t // destruction of top-level components is guarded in ReactMount.)\\n\\t\\t\\n\\t\\t if (!batchingStrategy.isBatchingUpdates) {\\n\\t\\t batchingStrategy.batchedUpdates(enqueueUpdate, component);\\n\\t\\t return;\\n\\t\\t }\\n\\t\\t\\n\\t\\t dirtyComponents.push(component);\\n\\t\\t if (component._updateBatchNumber == null) {\\n\\t\\t component._updateBatchNumber = updateBatchNumber + 1;\\n\\t\\t }\\n\\t\\t}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\",\n \"function batchedUpdates$1(fn, a) {\\n var previousIsBatchingUpdates = isBatchingUpdates;\\n isBatchingUpdates = true;\\n try {\\n return fn(a);\\n } finally {\\n isBatchingUpdates = previousIsBatchingUpdates;\\n if (!isBatchingUpdates && !isRendering) {\\n performSyncWork();\\n }\\n }\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6657742","0.661365","0.66131127","0.6544255","0.6544255","0.6123046","0.61036193","0.6044233","0.60355705","0.5957277","0.59142876","0.59142876","0.59142876","0.59142876","0.59142876","0.59142876","0.59142876","0.59142876","0.59142876","0.58709645","0.58619356","0.5827681","0.58195317","0.58164275","0.58061045","0.5802095","0.5791377","0.5791377","0.5772645","0.57585055","0.57370627","0.57370627","0.5732826","0.5732826","0.5732826","0.5732826","0.5732826","0.5732826","0.5732826","0.5732826","0.5732826","0.5732826","0.5732826","0.5732826","0.57278985","0.5727699","0.5715415","0.57134056","0.5666071","0.5666071","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.5649189","0.56356823","0.5623878","0.5618244","0.55952585","0.5592057","0.55809104","0.5575981","0.5571489","0.5569788","0.5568912","0.5568601","0.5558497","0.55216783","0.5509485","0.55027634","0.5500353","0.5500353","0.5500353","0.5500353","0.5500353","0.5500353"],"string":"[\n \"0.6657742\",\n \"0.661365\",\n \"0.66131127\",\n \"0.6544255\",\n \"0.6544255\",\n \"0.6123046\",\n \"0.61036193\",\n \"0.6044233\",\n \"0.60355705\",\n \"0.5957277\",\n \"0.59142876\",\n \"0.59142876\",\n \"0.59142876\",\n \"0.59142876\",\n \"0.59142876\",\n \"0.59142876\",\n \"0.59142876\",\n \"0.59142876\",\n \"0.59142876\",\n \"0.58709645\",\n \"0.58619356\",\n \"0.5827681\",\n \"0.58195317\",\n \"0.58164275\",\n \"0.58061045\",\n \"0.5802095\",\n \"0.5791377\",\n \"0.5791377\",\n \"0.5772645\",\n \"0.57585055\",\n \"0.57370627\",\n \"0.57370627\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.5732826\",\n \"0.57278985\",\n \"0.5727699\",\n \"0.5715415\",\n \"0.57134056\",\n \"0.5666071\",\n \"0.5666071\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.5649189\",\n \"0.56356823\",\n \"0.5623878\",\n \"0.5618244\",\n \"0.55952585\",\n \"0.5592057\",\n \"0.55809104\",\n \"0.5575981\",\n \"0.5571489\",\n \"0.5569788\",\n \"0.5568912\",\n \"0.5568601\",\n \"0.5558497\",\n \"0.55216783\",\n \"0.5509485\",\n \"0.55027634\",\n \"0.5500353\",\n \"0.5500353\",\n \"0.5500353\",\n \"0.5500353\",\n \"0.5500353\",\n \"0.5500353\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5796,"cells":{"query":{"kind":"string","value":"Base class helpers for the updating state of a component."},"document":{"kind":"string","value":"function Component(props, context, updater) {\n this.props = props;\n this.context = context;\n this.refs = emptyObject;\n // We initialize the default updater but the real one gets injected by the\n // renderer.\n this.updater = updater || ReactNoopUpdateQueue;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["update() {\n BaseState.update.call(this);\n }","_update() {\n // Call subclass lifecycle method\n const stateNeedsUpdate = this.needsUpdate();\n // End lifecycle method\n debug(TRACE_UPDATE, this, stateNeedsUpdate);\n\n if (stateNeedsUpdate) {\n this._updateState();\n }\n }","function _update() {\r\n this.component[this.prop] = this.control[this.prop];\r\n }","_handleComponentChange() {\n this.setState(this._getStateFromStore());\n }","update(data={}) {\n this.state = Object.assign(this.state, data);\n\n // notify all the Listeners of updated state\n this.notifyObervers(this.state);\n }","constructor() {\n super(); // Gives context for \"this\" within component.\n this.state = { txt: \"Hi There\"};\n this.update = this.update.bind(this);\n }","update(data = {}) {\n this.state = Object.assign(this.state, data);\n this.notify(this.state);\n }","updateState() {\n\t\tthis.trigger(this.state);\n\t}","constructor() {\n super(); // Gives context for \"this\" within component.\n this.state = { \n red: 0,\n green: 0,\n blue: 0,\n myTxt: \"--\"\n };\n this.update = this.update.bind(this);\n }","updateState(stateChange){\n this.setState(stateChange);\n }","updateState(state) {\n this.updateStateInner(state, this._props);\n }","setStateInternal(id, value) {\n var obj = id;\n if (! obj.startsWith(this.namespace + '.'))\n obj = this.namespace + '.' + id;\n this.log.info('update state ' + obj + ' with value:' + value);\n currentStateValues[obj] = value;\n }","handler(update) {\n this.setState(update)\n }","update(data = {}) {\r\n console.log(data);\r\n this.state = Object.assign(this.state, data);\r\n this.notify(this.state);\r\n }","setState(updateObject) {\n this.setChangeFlags({stateChanged: true});\n Object.assign(this.state, updateObject);\n this.setNeedsRedraw();\n }","_updateStateValue(prop, v) {\n return new Promise((resolve, reject) => {\n var c = this._component\n if(c.state && c.state[prop] !== undefined){\n var state = {}\n state[prop] = v\n c.setState(state, resolve)\n }else{\n c[prop] = v\n c.forceUpdate()\n resolve()\n }\n })\n }","stateChanged(state) { }","setState(newState) {\n this.state = {\n ...this.state,\n ...newState\n }\n this.#updater()\n }","update() {\n // Subclasses should override\n }","function updateValue( value ) \n{\n \n updateComponentValue( value );\n \n}","updateItem() {\n this.setState(this.state);\n }","stateChanged(_state) { }","update() {\r\n throw new Error('must be set in subclass');\r\n }","update() {\n const state = this.store.getState();\n\n if (this.isPresenting !== state.webvr.isPresenting) {\n this.vrEffect.setFullScreen(state.webvr.isPresenting);\n this.isPresenting = state.webvr.isPresenting;\n }\n\n if (this.isPresenting) {\n this.vrControls.update();\n } else {\n const dt = (state.app.timestamp - this.timestamp) || 0;\n this.timestamp = state.app.timestamp;\n\n this.flyControls.update(dt);\n }\n\n // update all components with their state\n const componentState = this.select(state);\n Object.keys(this.components)\n .forEach(id => this.components[id].update(componentState[id]));\n }","updateState(newState) {\n this.setState(newState);\n }","update(object) {\n for (const prop in object){\n this.state[prop] = object[prop];\n }\n //change has been made to data so call handler\n this.fire();\n\n }","update(object) {\n for (const prop in object){\n this.state[prop] = object[prop];\n }\n //change has been made to data so call handler\n this.fire();\n\n }","update(...props) {\n if (this.onUpdate && this._) {\n return this.onUpdate(...props);\n }\n }","updateComponentState(componentUpdate, sectionIndex, gridSectionIndex, componentStateIndex) {\n if (!this.state.globalContextObj.editing) return\n\n this.setState((state, props) => {\n let component = state.pages[state.globalContextObj.editing].sections[sectionIndex].gridSections[gridSectionIndex].componentStates[componentStateIndex]\n state.pages[state.globalContextObj.editing].sections[sectionIndex].gridSections[gridSectionIndex].componentStates[componentStateIndex] = deepStyleMerge(component, componentUpdate)\n return {\n pages: state.pages\n }\n })\n }","setState(newState, cb) {\n // Merge both new and old state to replace whats new an keep whats old.\n this.state = {...this.state, ...newState};\n\n // re-render the element with a given renderer callback\n if (cb) cb(this.state, this.element);\n }","_triggerComponentUpdate(value) {\n if (has(this.props, 'valueLink')) {\n this.props.valueLink.requestChange(value);\n this.setState({\n focusedValue: undefined,\n isActive: false,\n });\n } else if (has(this.props, 'value')) {\n this.setState({\n focusedValue: undefined,\n isActive: false,\n });\n } else {\n this.setState({\n focusedValue: undefined,\n isActive: false,\n value,\n });\n }\n\n if (this.props.onUpdate) {\n this.props.onUpdate({ value });\n }\n }","_onChangeState() {\n\n\n }","update (descriptor) {\n // update helper's own UI if needed\n // etc\n }","componentWillUpdate() {}","constructor(props) {\n super(props);\n this.shouldComponentUpdate = PureRenderMixin.shouldComponentUpdate.bind(this);\n }","function setComponentState(componentId, key, value) {\n var componentState = getViewState(componentId);\n if (!componentState) {\n componentState = new Object();\n setViewState(componentId, componentState);\n }\n componentState[key] = value;\n}","_stateChanged(_state) {\n throw new Error('_stateChanged() not implemented');\n }","onUpdate(data) {\n this.setState(data);\n }","handleUpdatedState(state) {\n this.lastTechnology = state.selectedTechnology;\n this.totalClicks = state.clickCounter;\n }","stateUpdate() {\n this.handlestateVariable();\n this.handlestateVariable2();\n this.handleCChange();\n this.handleAChange();\n this.handleidCapture();\n this.handleimgCapture();\n this.handleConfigChange();\n this.idcaptureVal();\n this.imgcaptureVal();\n }","componentDidUpdate() {\n this.props.actions.updateQuestionSuccess({id: this.state.id, value: this.state.question});\n }","update(key, value) {\n let property = {};\n property[key] = value;\n // Change state\n this.setState(property, () => this.getData());\n }","componentWillUpdate () {}","_UpdateComponents() {\n this.loadedComponents.forEach((component) => {\n if(component.binding) {\n // Update the component from its bound value if the value has changed\n if(component.binding.object[component.binding.property] != component.oldValue) {\n component.SetValue(component.binding.object[component.binding.property]);\n component.oldValue = component.binding.object[component.binding.property];\n }\n }\n });\n\n setTimeout(() => {\n window.requestAnimationFrame(() => {\n this._UpdateComponents();\n });\n }, this.opts.pollRateMS);\n\n }","_updateState() {\n const currentProps = this.props;\n const currentViewport = this.context.viewport;\n const propsInTransition = this._updateUniformTransition();\n this.internalState.propsInTransition = propsInTransition;\n // Overwrite this.context.viewport during update to use the last activated viewport on this layer\n // In multi-view applications, a layer may only be drawn in one of the views\n // Which would make the \"active\" viewport different from the shared context\n this.context.viewport = this.internalState.viewport || currentViewport;\n // Overwrite this.props during update to use in-transition prop values\n this.props = propsInTransition;\n\n try {\n const updateParams = this._getUpdateParams();\n const oldModels = this.getModels();\n\n // Safely call subclass lifecycle methods\n if (this.context.gl) {\n this.updateState(updateParams);\n } else {\n try {\n this.updateState(updateParams);\n } catch (error) {\n // ignore error if gl context is missing\n }\n }\n // Execute extension updates\n for (const extension of this.props.extensions) {\n extension.updateState.call(this, updateParams, extension);\n }\n\n const modelChanged = this.getModels()[0] !== oldModels[0];\n this._updateModules(updateParams, modelChanged);\n // End subclass lifecycle methods\n\n if (this.isComposite) {\n // Render or update previously rendered sublayers\n this._renderLayers(updateParams);\n } else {\n this.setNeedsRedraw();\n // Add any subclass attributes\n this._updateAttributes(this.props);\n\n // Note: Automatic instance count update only works for single layers\n if (this.state.model) {\n this.state.model.setInstanceCount(this.getNumInstances());\n }\n }\n } finally {\n // Restore shared context\n this.context.viewport = currentViewport;\n this.props = currentProps;\n this.clearChangeFlags();\n this.internalState.needsUpdate = false;\n this.internalState.resetOldProps();\n }\n }","componentDidUpdate() {\n this.props.actions.updateAnswerSuccess({\n questionId: this.state.questionId,\n id: this.state.id,\n label: this.state.answer,\n isTrue: this.props.isTrue\n });\n }","stateChanged(state) {\n }","handleUpdate(data) {\n this.setState({ data });\n}","constructor(...args){\n super(...args)\n this.shouldComponentUpdate=PureRenderMixin.shouldComponentUpdate\n this.state={\n userName:''\n }\n }","constructor(...args){\n super(...args)\n this.shouldComponentUpdate=PureRenderMixin.shouldComponentUpdate\n this.state={\n userName:''\n }\n }","componentWillUpdate(np,ns){ }","componentDidUpdate(preProps,preState,a){\n console.log(\"componentDidUpdate\",a)\n }","setState(newProps) {\n let stateChanged = false;\n\n Object.entries(newProps).forEach(([key, val]) => {\n if (val !== this.state[key]) {\n stateChanged = true;\n }\n\n this.state[key] = val;\n });\n\n if (stateChanged) {\n this.render();\n }\n }","function update() {\n // ... no implementation required\n }","function updater(prevState){var state=this.constructor.getDerivedStateFromProps(nextProps,prevState);return state!==null&&state!==undefined?state:null;}// Binding \"this\" is important for shallow renderer support.","componentDidUpdate(){\r\n console.log(\"Update\", this.state);\r\n }","updateData(config) {\r\n this.setState(config);\r\n }","componentWillUpdate(e, state) {\n if (state.x) {\n this.xElement.innerHTML = ' x: ' + state.x\n } \n if (state.y) {\n this.yElement.innerHTML = ' y: ' + state.y\n } \n }","updateState (val, key) {\n this.state[key] = val\n this.updateUI()\n }","refresh_() {\n // Can be overridden in sub-component.\n }","stateChanged(state) {\n \n throw new Error('stateChanged() not implemented', this);\n }","setState(state, callback) {\n if (!this.prevState) this.prevState = this.state;\n this.state = this._extend(\n this._extend({}, this.state),\n typeof state === 'function' ? state(this.state, this.props) : state\n );\n let dom = this.getDomElement();\n let container = dom.parentNode;\n let newVDom = this.render(); // This will invoke the derived class render menthod\n newVDom.component = this;\n diff (newVDom, container, dom);\n }","handleUpdateBox(id, title) {\n this.setState({updatedId: id, updatedTitle: title});\n }","setState (state) {\r\n this.state = state;\r\n }","componentDidUpdate(props_) {}","constructor(props) {\n \t//calling parent method with super\n \tsuper(props);\n//functional components don't have state, only class-based components do\n//term is property on which we want to record change\n \tthis.state = { term: ''};\n //the above live can only be in the constructor, so every instance will take a copy of the current state\n }","updateComponents () {\n\t\tfor (let component in this.components) {\n\t\t\tthis.components[component].update();\n\t\t}\n\t}","componentDidUpdate(prevProps, prevState, snapshot){\n console.info(this.constructor.name+' Did my component updated?');\n\n }","update( e ){\n // Assign to let changedID ID of slider which has been changed\n let changedID = e.target.id;\n let value = e.target.value;\n if (changedID === 'sliderAmount') {\n this.setState({valueAmount: e.target.value});\n }\n if (changedID === 'sliderDuration'){\n this.setState({valueDuration: e.target.value});\n }\n\n\n this.calculate(changedID, value);\n }","setState(_state, _args) {\n\t // This has to be handled at a higher level since we can't\n\t // replace the whole tree here however we still need a method here\n\t // so it appears on the proxy Actions class.\n\t throw new Error('Called setState on StateActions.');\n\t }","componentWillUpdate(nextProps) {\n if (this.props.value !== nextProps.value) {\n this.setState({ value: this.props.value });\n }\n }","componentWillUpdate() {\n console.log('Before updating a component');\n }","updateFormFieldInState(formField, value) {\n\n }","onChangeStatus(newStatus) {\n return () => {\n this.props.changeStatus(newStatus)\n };\n }","componentDidUpdate(prevProps) {\n if (\n prevProps.currentIndex != this.props.currentIndex ||\n prevProps.list.length != this.props.list.length\n )\n this.setState({\n ...this.EditStateFunction()\n });\n }","updateState(e, val) {\n val === undefined ? val = e.target.value : val; // catch location input field value since it behaves differently\n let key = e.target.name;\n // you must use a function to set state if the key is a variable\n let stateObj = function() {\n var obj = {};\n obj[key] = val;\n return obj;\n }.bind(e)();\n this.setState( stateObj );\n\n }","componentDidUpdate() {\n\t\t/* preserve context */\n\t\tconst _this = this;\n\t}","componentDidUpdate() {\n\t\t/* preserve context */\n\t\tconst _this = this;\n\t}","state (...args) {\n return MVC.ComponentJS(this).state(...args)\n }","_updateInput (input) {\n this.setState({ input })\n }","_update() {\n }","shouldComponentUpdate(newProps, newState) {\n // console.log(\"=========================> shouldComponentUpdate\", newProps, newState);\n return true;\n }","_requestUpdate(name,oldValue){let shouldRequestUpdate=!0;// If we have a property key, perform property update steps.\nif(name!==void 0){const ctor=this.constructor,options=ctor._classProperties.get(name)||defaultPropertyDeclaration;if(ctor._valueHasChanged(this[name],oldValue,options.hasChanged)){if(!this._changedProperties.has(name)){this._changedProperties.set(name,oldValue)}// Add to reflecting properties set.\n// Note, it's important that every change has a chance to add the\n// property to `_reflectingProperties`. This ensures setting\n// attribute + property reflects correctly.\nif(!0===options.reflect&&!(this._updateState&STATE_IS_REFLECTING_TO_PROPERTY)){if(this._reflectingProperties===void 0){this._reflectingProperties=new Map}this._reflectingProperties.set(name,options)}}else{// Abort the request if the property should not be considered changed.\nshouldRequestUpdate=!1}}if(!this._hasRequestedUpdate&&shouldRequestUpdate){this._enqueueUpdate()}}","componentDidUpdate(prepProps, prevState) {\n if (!this.props.onChange) return;\n if (_.isEqual(prevState, this.state)) return;\n\n const stateNow = {...this.state};\n this.debouncedOnChange(stateNow);\n }","function newState(state) {\n alert(\"This functionality is yet to be implemented!\");\n }","update()\n\t{ \n\t\tthrow new Error(\"update() method not implemented\");\n\t}","setState (newState) {\n this._state = assign({}, this._state, newState);\n this.trigger(assign({}, this._state));\n }","update() {\n this.setState({\n numberOfGuests: this.props.model.getNumberOfGuests(),\n menu: this.props.model.getMenu(),\n menuPrice: this.props.model.calcCost(),\n });\n }","update(props) {\n if (props.handleDOMEvents != this._props.handleDOMEvents)\n ensureListeners(this);\n let prevProps = this._props;\n this._props = props;\n if (props.plugins) {\n props.plugins.forEach(checkStateComponent);\n this.directPlugins = props.plugins;\n }\n this.updateStateInner(props.state, prevProps);\n }","setState (newState) {\n this.state = {...newState};\n if (this.updaterWin) {\n this.updaterWin.send('update-state-change', this.state);\n }\n }","componentUpdated(el, binding, vnode) {\n const self = vnode.context\n const instanceName = getInstanceName(el, binding, vnode)\n const options = binding.value || {}\n const quill = self[instanceName]\n if (quill) {\n const model = vnode.data.model\n const _value = vnode.data.attrs ? vnode.data.attrs.value : null\n const _content = vnode.data.attrs ? vnode.data.attrs.content : null\n const disabled = vnode.data.attrs ? vnode.data.attrs.disabled : null\n const content = model ? model.value : (_value || _content)\n const newData = content\n const oldData = el.children[0].innerHTML\n quill.enable(!disabled)\n if (newData) {\n if (newData != oldData) {\n const range = quill.getSelection()\n quill.root.innerHTML = newData\n setTimeout(() => {\n quill.setSelection(range)\n })\n }\n } else {\n quill.setText('')\n }\n }\n }","componentUpdated(el, binding, vnode) {\n const self = vnode.context\n const instanceName = getInstanceName(el, binding, vnode)\n const options = binding.value || {}\n const quill = self[instanceName]\n if (quill) {\n const model = vnode.data.model\n const _value = vnode.data.attrs ? vnode.data.attrs.value : null\n const _content = vnode.data.attrs ? vnode.data.attrs.content : null\n const disabled = vnode.data.attrs ? vnode.data.attrs.disabled : null\n const content = model ? model.value : (_value || _content)\n const newData = content\n const oldData = el.children[0].innerHTML\n quill.enable(!disabled)\n if (newData) {\n if (newData != oldData) {\n const range = quill.getSelection()\n quill.root.innerHTML = newData\n setTimeout(() => {\n quill.setSelection(range)\n })\n }\n } else {\n quill.setText('')\n }\n }\n }","privateSendUpdate () {\n this.emit('update', this.getState())\n }","componentDidUpdate(prevProps) {\n // Is called when the corresponding state is changed in parent class (indirect trigger)\n // Is also called a 2nd time when setState{open:true} is called inside this function\n if (prevProps != this.props) {\n this.state.type = this.props.popUp.type;\n this.state.message = this.props.popUp.message;\n this.state.open = this.props.popUp.openPopUp;\n this.checkAction();\n }\n }","_onChange() {\n if (this.isMounted()) {\n this.setState({ value: ButtonStore.getValue() });\n this.setState({ session: AuthStore.getSession() });\n }\n }","componentDidUpdate(prevProps, prevState) { // eslint-disable-line\n if (this.state.value !== prevState.value) {\n this.props.setValue(this.state.value);\n if (this.state.manualChangeKey !== prevState.manualChangeKey || this.props.shouldUpdateAlways) {\n this.props.onChangeInput(this.props.name, this.state.value);\n }\n }\n }","componentDidUpdate(preProps, preState, a) {\n console.log('componentDidUpdate', a);\n\n }","_requestUpdate(e,t){let n=!0;// If we have a property key, perform property update steps.\nif(e!==void 0){const r=this.constructor,a=r._classProperties.get(e)||defaultPropertyDeclaration;r._valueHasChanged(this[e],t,a.hasChanged)?(!this._changedProperties.has(e)&&this._changedProperties.set(e,t),!0===a.reflect&&!(this._updateState&STATE_IS_REFLECTING_TO_PROPERTY)&&(this._reflectingProperties===void 0&&(this._reflectingProperties=new Map),this._reflectingProperties.set(e,a))):n=!1}!this._hasRequestedUpdate&&n&&this._enqueueUpdate()}","_onChange() {\n this.setState(getUserState());\n }","componentWillUpdate(){\n }","update() {\n throw new Error(\"Not Implemented\");\n }"],"string":"[\n \"update() {\\n BaseState.update.call(this);\\n }\",\n \"_update() {\\n // Call subclass lifecycle method\\n const stateNeedsUpdate = this.needsUpdate();\\n // End lifecycle method\\n debug(TRACE_UPDATE, this, stateNeedsUpdate);\\n\\n if (stateNeedsUpdate) {\\n this._updateState();\\n }\\n }\",\n \"function _update() {\\r\\n this.component[this.prop] = this.control[this.prop];\\r\\n }\",\n \"_handleComponentChange() {\\n this.setState(this._getStateFromStore());\\n }\",\n \"update(data={}) {\\n this.state = Object.assign(this.state, data);\\n\\n // notify all the Listeners of updated state\\n this.notifyObervers(this.state);\\n }\",\n \"constructor() {\\n super(); // Gives context for \\\"this\\\" within component.\\n this.state = { txt: \\\"Hi There\\\"};\\n this.update = this.update.bind(this);\\n }\",\n \"update(data = {}) {\\n this.state = Object.assign(this.state, data);\\n this.notify(this.state);\\n }\",\n \"updateState() {\\n\\t\\tthis.trigger(this.state);\\n\\t}\",\n \"constructor() {\\n super(); // Gives context for \\\"this\\\" within component.\\n this.state = { \\n red: 0,\\n green: 0,\\n blue: 0,\\n myTxt: \\\"--\\\"\\n };\\n this.update = this.update.bind(this);\\n }\",\n \"updateState(stateChange){\\n this.setState(stateChange);\\n }\",\n \"updateState(state) {\\n this.updateStateInner(state, this._props);\\n }\",\n \"setStateInternal(id, value) {\\n var obj = id;\\n if (! obj.startsWith(this.namespace + '.'))\\n obj = this.namespace + '.' + id;\\n this.log.info('update state ' + obj + ' with value:' + value);\\n currentStateValues[obj] = value;\\n }\",\n \"handler(update) {\\n this.setState(update)\\n }\",\n \"update(data = {}) {\\r\\n console.log(data);\\r\\n this.state = Object.assign(this.state, data);\\r\\n this.notify(this.state);\\r\\n }\",\n \"setState(updateObject) {\\n this.setChangeFlags({stateChanged: true});\\n Object.assign(this.state, updateObject);\\n this.setNeedsRedraw();\\n }\",\n \"_updateStateValue(prop, v) {\\n return new Promise((resolve, reject) => {\\n var c = this._component\\n if(c.state && c.state[prop] !== undefined){\\n var state = {}\\n state[prop] = v\\n c.setState(state, resolve)\\n }else{\\n c[prop] = v\\n c.forceUpdate()\\n resolve()\\n }\\n })\\n }\",\n \"stateChanged(state) { }\",\n \"setState(newState) {\\n this.state = {\\n ...this.state,\\n ...newState\\n }\\n this.#updater()\\n }\",\n \"update() {\\n // Subclasses should override\\n }\",\n \"function updateValue( value ) \\n{\\n \\n updateComponentValue( value );\\n \\n}\",\n \"updateItem() {\\n this.setState(this.state);\\n }\",\n \"stateChanged(_state) { }\",\n \"update() {\\r\\n throw new Error('must be set in subclass');\\r\\n }\",\n \"update() {\\n const state = this.store.getState();\\n\\n if (this.isPresenting !== state.webvr.isPresenting) {\\n this.vrEffect.setFullScreen(state.webvr.isPresenting);\\n this.isPresenting = state.webvr.isPresenting;\\n }\\n\\n if (this.isPresenting) {\\n this.vrControls.update();\\n } else {\\n const dt = (state.app.timestamp - this.timestamp) || 0;\\n this.timestamp = state.app.timestamp;\\n\\n this.flyControls.update(dt);\\n }\\n\\n // update all components with their state\\n const componentState = this.select(state);\\n Object.keys(this.components)\\n .forEach(id => this.components[id].update(componentState[id]));\\n }\",\n \"updateState(newState) {\\n this.setState(newState);\\n }\",\n \"update(object) {\\n for (const prop in object){\\n this.state[prop] = object[prop];\\n }\\n //change has been made to data so call handler\\n this.fire();\\n\\n }\",\n \"update(object) {\\n for (const prop in object){\\n this.state[prop] = object[prop];\\n }\\n //change has been made to data so call handler\\n this.fire();\\n\\n }\",\n \"update(...props) {\\n if (this.onUpdate && this._) {\\n return this.onUpdate(...props);\\n }\\n }\",\n \"updateComponentState(componentUpdate, sectionIndex, gridSectionIndex, componentStateIndex) {\\n if (!this.state.globalContextObj.editing) return\\n\\n this.setState((state, props) => {\\n let component = state.pages[state.globalContextObj.editing].sections[sectionIndex].gridSections[gridSectionIndex].componentStates[componentStateIndex]\\n state.pages[state.globalContextObj.editing].sections[sectionIndex].gridSections[gridSectionIndex].componentStates[componentStateIndex] = deepStyleMerge(component, componentUpdate)\\n return {\\n pages: state.pages\\n }\\n })\\n }\",\n \"setState(newState, cb) {\\n // Merge both new and old state to replace whats new an keep whats old.\\n this.state = {...this.state, ...newState};\\n\\n // re-render the element with a given renderer callback\\n if (cb) cb(this.state, this.element);\\n }\",\n \"_triggerComponentUpdate(value) {\\n if (has(this.props, 'valueLink')) {\\n this.props.valueLink.requestChange(value);\\n this.setState({\\n focusedValue: undefined,\\n isActive: false,\\n });\\n } else if (has(this.props, 'value')) {\\n this.setState({\\n focusedValue: undefined,\\n isActive: false,\\n });\\n } else {\\n this.setState({\\n focusedValue: undefined,\\n isActive: false,\\n value,\\n });\\n }\\n\\n if (this.props.onUpdate) {\\n this.props.onUpdate({ value });\\n }\\n }\",\n \"_onChangeState() {\\n\\n\\n }\",\n \"update (descriptor) {\\n // update helper's own UI if needed\\n // etc\\n }\",\n \"componentWillUpdate() {}\",\n \"constructor(props) {\\n super(props);\\n this.shouldComponentUpdate = PureRenderMixin.shouldComponentUpdate.bind(this);\\n }\",\n \"function setComponentState(componentId, key, value) {\\n var componentState = getViewState(componentId);\\n if (!componentState) {\\n componentState = new Object();\\n setViewState(componentId, componentState);\\n }\\n componentState[key] = value;\\n}\",\n \"_stateChanged(_state) {\\n throw new Error('_stateChanged() not implemented');\\n }\",\n \"onUpdate(data) {\\n this.setState(data);\\n }\",\n \"handleUpdatedState(state) {\\n this.lastTechnology = state.selectedTechnology;\\n this.totalClicks = state.clickCounter;\\n }\",\n \"stateUpdate() {\\n this.handlestateVariable();\\n this.handlestateVariable2();\\n this.handleCChange();\\n this.handleAChange();\\n this.handleidCapture();\\n this.handleimgCapture();\\n this.handleConfigChange();\\n this.idcaptureVal();\\n this.imgcaptureVal();\\n }\",\n \"componentDidUpdate() {\\n this.props.actions.updateQuestionSuccess({id: this.state.id, value: this.state.question});\\n }\",\n \"update(key, value) {\\n let property = {};\\n property[key] = value;\\n // Change state\\n this.setState(property, () => this.getData());\\n }\",\n \"componentWillUpdate () {}\",\n \"_UpdateComponents() {\\n this.loadedComponents.forEach((component) => {\\n if(component.binding) {\\n // Update the component from its bound value if the value has changed\\n if(component.binding.object[component.binding.property] != component.oldValue) {\\n component.SetValue(component.binding.object[component.binding.property]);\\n component.oldValue = component.binding.object[component.binding.property];\\n }\\n }\\n });\\n\\n setTimeout(() => {\\n window.requestAnimationFrame(() => {\\n this._UpdateComponents();\\n });\\n }, this.opts.pollRateMS);\\n\\n }\",\n \"_updateState() {\\n const currentProps = this.props;\\n const currentViewport = this.context.viewport;\\n const propsInTransition = this._updateUniformTransition();\\n this.internalState.propsInTransition = propsInTransition;\\n // Overwrite this.context.viewport during update to use the last activated viewport on this layer\\n // In multi-view applications, a layer may only be drawn in one of the views\\n // Which would make the \\\"active\\\" viewport different from the shared context\\n this.context.viewport = this.internalState.viewport || currentViewport;\\n // Overwrite this.props during update to use in-transition prop values\\n this.props = propsInTransition;\\n\\n try {\\n const updateParams = this._getUpdateParams();\\n const oldModels = this.getModels();\\n\\n // Safely call subclass lifecycle methods\\n if (this.context.gl) {\\n this.updateState(updateParams);\\n } else {\\n try {\\n this.updateState(updateParams);\\n } catch (error) {\\n // ignore error if gl context is missing\\n }\\n }\\n // Execute extension updates\\n for (const extension of this.props.extensions) {\\n extension.updateState.call(this, updateParams, extension);\\n }\\n\\n const modelChanged = this.getModels()[0] !== oldModels[0];\\n this._updateModules(updateParams, modelChanged);\\n // End subclass lifecycle methods\\n\\n if (this.isComposite) {\\n // Render or update previously rendered sublayers\\n this._renderLayers(updateParams);\\n } else {\\n this.setNeedsRedraw();\\n // Add any subclass attributes\\n this._updateAttributes(this.props);\\n\\n // Note: Automatic instance count update only works for single layers\\n if (this.state.model) {\\n this.state.model.setInstanceCount(this.getNumInstances());\\n }\\n }\\n } finally {\\n // Restore shared context\\n this.context.viewport = currentViewport;\\n this.props = currentProps;\\n this.clearChangeFlags();\\n this.internalState.needsUpdate = false;\\n this.internalState.resetOldProps();\\n }\\n }\",\n \"componentDidUpdate() {\\n this.props.actions.updateAnswerSuccess({\\n questionId: this.state.questionId,\\n id: this.state.id,\\n label: this.state.answer,\\n isTrue: this.props.isTrue\\n });\\n }\",\n \"stateChanged(state) {\\n }\",\n \"handleUpdate(data) {\\n this.setState({ data });\\n}\",\n \"constructor(...args){\\n super(...args)\\n this.shouldComponentUpdate=PureRenderMixin.shouldComponentUpdate\\n this.state={\\n userName:''\\n }\\n }\",\n \"constructor(...args){\\n super(...args)\\n this.shouldComponentUpdate=PureRenderMixin.shouldComponentUpdate\\n this.state={\\n userName:''\\n }\\n }\",\n \"componentWillUpdate(np,ns){ }\",\n \"componentDidUpdate(preProps,preState,a){\\n console.log(\\\"componentDidUpdate\\\",a)\\n }\",\n \"setState(newProps) {\\n let stateChanged = false;\\n\\n Object.entries(newProps).forEach(([key, val]) => {\\n if (val !== this.state[key]) {\\n stateChanged = true;\\n }\\n\\n this.state[key] = val;\\n });\\n\\n if (stateChanged) {\\n this.render();\\n }\\n }\",\n \"function update() {\\n // ... no implementation required\\n }\",\n \"function updater(prevState){var state=this.constructor.getDerivedStateFromProps(nextProps,prevState);return state!==null&&state!==undefined?state:null;}// Binding \\\"this\\\" is important for shallow renderer support.\",\n \"componentDidUpdate(){\\r\\n console.log(\\\"Update\\\", this.state);\\r\\n }\",\n \"updateData(config) {\\r\\n this.setState(config);\\r\\n }\",\n \"componentWillUpdate(e, state) {\\n if (state.x) {\\n this.xElement.innerHTML = ' x: ' + state.x\\n } \\n if (state.y) {\\n this.yElement.innerHTML = ' y: ' + state.y\\n } \\n }\",\n \"updateState (val, key) {\\n this.state[key] = val\\n this.updateUI()\\n }\",\n \"refresh_() {\\n // Can be overridden in sub-component.\\n }\",\n \"stateChanged(state) {\\n \\n throw new Error('stateChanged() not implemented', this);\\n }\",\n \"setState(state, callback) {\\n if (!this.prevState) this.prevState = this.state;\\n this.state = this._extend(\\n this._extend({}, this.state),\\n typeof state === 'function' ? state(this.state, this.props) : state\\n );\\n let dom = this.getDomElement();\\n let container = dom.parentNode;\\n let newVDom = this.render(); // This will invoke the derived class render menthod\\n newVDom.component = this;\\n diff (newVDom, container, dom);\\n }\",\n \"handleUpdateBox(id, title) {\\n this.setState({updatedId: id, updatedTitle: title});\\n }\",\n \"setState (state) {\\r\\n this.state = state;\\r\\n }\",\n \"componentDidUpdate(props_) {}\",\n \"constructor(props) {\\n \\t//calling parent method with super\\n \\tsuper(props);\\n//functional components don't have state, only class-based components do\\n//term is property on which we want to record change\\n \\tthis.state = { term: ''};\\n //the above live can only be in the constructor, so every instance will take a copy of the current state\\n }\",\n \"updateComponents () {\\n\\t\\tfor (let component in this.components) {\\n\\t\\t\\tthis.components[component].update();\\n\\t\\t}\\n\\t}\",\n \"componentDidUpdate(prevProps, prevState, snapshot){\\n console.info(this.constructor.name+' Did my component updated?');\\n\\n }\",\n \"update( e ){\\n // Assign to let changedID ID of slider which has been changed\\n let changedID = e.target.id;\\n let value = e.target.value;\\n if (changedID === 'sliderAmount') {\\n this.setState({valueAmount: e.target.value});\\n }\\n if (changedID === 'sliderDuration'){\\n this.setState({valueDuration: e.target.value});\\n }\\n\\n\\n this.calculate(changedID, value);\\n }\",\n \"setState(_state, _args) {\\n\\t // This has to be handled at a higher level since we can't\\n\\t // replace the whole tree here however we still need a method here\\n\\t // so it appears on the proxy Actions class.\\n\\t throw new Error('Called setState on StateActions.');\\n\\t }\",\n \"componentWillUpdate(nextProps) {\\n if (this.props.value !== nextProps.value) {\\n this.setState({ value: this.props.value });\\n }\\n }\",\n \"componentWillUpdate() {\\n console.log('Before updating a component');\\n }\",\n \"updateFormFieldInState(formField, value) {\\n\\n }\",\n \"onChangeStatus(newStatus) {\\n return () => {\\n this.props.changeStatus(newStatus)\\n };\\n }\",\n \"componentDidUpdate(prevProps) {\\n if (\\n prevProps.currentIndex != this.props.currentIndex ||\\n prevProps.list.length != this.props.list.length\\n )\\n this.setState({\\n ...this.EditStateFunction()\\n });\\n }\",\n \"updateState(e, val) {\\n val === undefined ? val = e.target.value : val; // catch location input field value since it behaves differently\\n let key = e.target.name;\\n // you must use a function to set state if the key is a variable\\n let stateObj = function() {\\n var obj = {};\\n obj[key] = val;\\n return obj;\\n }.bind(e)();\\n this.setState( stateObj );\\n\\n }\",\n \"componentDidUpdate() {\\n\\t\\t/* preserve context */\\n\\t\\tconst _this = this;\\n\\t}\",\n \"componentDidUpdate() {\\n\\t\\t/* preserve context */\\n\\t\\tconst _this = this;\\n\\t}\",\n \"state (...args) {\\n return MVC.ComponentJS(this).state(...args)\\n }\",\n \"_updateInput (input) {\\n this.setState({ input })\\n }\",\n \"_update() {\\n }\",\n \"shouldComponentUpdate(newProps, newState) {\\n // console.log(\\\"=========================> shouldComponentUpdate\\\", newProps, newState);\\n return true;\\n }\",\n \"_requestUpdate(name,oldValue){let shouldRequestUpdate=!0;// If we have a property key, perform property update steps.\\nif(name!==void 0){const ctor=this.constructor,options=ctor._classProperties.get(name)||defaultPropertyDeclaration;if(ctor._valueHasChanged(this[name],oldValue,options.hasChanged)){if(!this._changedProperties.has(name)){this._changedProperties.set(name,oldValue)}// Add to reflecting properties set.\\n// Note, it's important that every change has a chance to add the\\n// property to `_reflectingProperties`. This ensures setting\\n// attribute + property reflects correctly.\\nif(!0===options.reflect&&!(this._updateState&STATE_IS_REFLECTING_TO_PROPERTY)){if(this._reflectingProperties===void 0){this._reflectingProperties=new Map}this._reflectingProperties.set(name,options)}}else{// Abort the request if the property should not be considered changed.\\nshouldRequestUpdate=!1}}if(!this._hasRequestedUpdate&&shouldRequestUpdate){this._enqueueUpdate()}}\",\n \"componentDidUpdate(prepProps, prevState) {\\n if (!this.props.onChange) return;\\n if (_.isEqual(prevState, this.state)) return;\\n\\n const stateNow = {...this.state};\\n this.debouncedOnChange(stateNow);\\n }\",\n \"function newState(state) {\\n alert(\\\"This functionality is yet to be implemented!\\\");\\n }\",\n \"update()\\n\\t{ \\n\\t\\tthrow new Error(\\\"update() method not implemented\\\");\\n\\t}\",\n \"setState (newState) {\\n this._state = assign({}, this._state, newState);\\n this.trigger(assign({}, this._state));\\n }\",\n \"update() {\\n this.setState({\\n numberOfGuests: this.props.model.getNumberOfGuests(),\\n menu: this.props.model.getMenu(),\\n menuPrice: this.props.model.calcCost(),\\n });\\n }\",\n \"update(props) {\\n if (props.handleDOMEvents != this._props.handleDOMEvents)\\n ensureListeners(this);\\n let prevProps = this._props;\\n this._props = props;\\n if (props.plugins) {\\n props.plugins.forEach(checkStateComponent);\\n this.directPlugins = props.plugins;\\n }\\n this.updateStateInner(props.state, prevProps);\\n }\",\n \"setState (newState) {\\n this.state = {...newState};\\n if (this.updaterWin) {\\n this.updaterWin.send('update-state-change', this.state);\\n }\\n }\",\n \"componentUpdated(el, binding, vnode) {\\n const self = vnode.context\\n const instanceName = getInstanceName(el, binding, vnode)\\n const options = binding.value || {}\\n const quill = self[instanceName]\\n if (quill) {\\n const model = vnode.data.model\\n const _value = vnode.data.attrs ? vnode.data.attrs.value : null\\n const _content = vnode.data.attrs ? vnode.data.attrs.content : null\\n const disabled = vnode.data.attrs ? vnode.data.attrs.disabled : null\\n const content = model ? model.value : (_value || _content)\\n const newData = content\\n const oldData = el.children[0].innerHTML\\n quill.enable(!disabled)\\n if (newData) {\\n if (newData != oldData) {\\n const range = quill.getSelection()\\n quill.root.innerHTML = newData\\n setTimeout(() => {\\n quill.setSelection(range)\\n })\\n }\\n } else {\\n quill.setText('')\\n }\\n }\\n }\",\n \"componentUpdated(el, binding, vnode) {\\n const self = vnode.context\\n const instanceName = getInstanceName(el, binding, vnode)\\n const options = binding.value || {}\\n const quill = self[instanceName]\\n if (quill) {\\n const model = vnode.data.model\\n const _value = vnode.data.attrs ? vnode.data.attrs.value : null\\n const _content = vnode.data.attrs ? vnode.data.attrs.content : null\\n const disabled = vnode.data.attrs ? vnode.data.attrs.disabled : null\\n const content = model ? model.value : (_value || _content)\\n const newData = content\\n const oldData = el.children[0].innerHTML\\n quill.enable(!disabled)\\n if (newData) {\\n if (newData != oldData) {\\n const range = quill.getSelection()\\n quill.root.innerHTML = newData\\n setTimeout(() => {\\n quill.setSelection(range)\\n })\\n }\\n } else {\\n quill.setText('')\\n }\\n }\\n }\",\n \"privateSendUpdate () {\\n this.emit('update', this.getState())\\n }\",\n \"componentDidUpdate(prevProps) {\\n // Is called when the corresponding state is changed in parent class (indirect trigger)\\n // Is also called a 2nd time when setState{open:true} is called inside this function\\n if (prevProps != this.props) {\\n this.state.type = this.props.popUp.type;\\n this.state.message = this.props.popUp.message;\\n this.state.open = this.props.popUp.openPopUp;\\n this.checkAction();\\n }\\n }\",\n \"_onChange() {\\n if (this.isMounted()) {\\n this.setState({ value: ButtonStore.getValue() });\\n this.setState({ session: AuthStore.getSession() });\\n }\\n }\",\n \"componentDidUpdate(prevProps, prevState) { // eslint-disable-line\\n if (this.state.value !== prevState.value) {\\n this.props.setValue(this.state.value);\\n if (this.state.manualChangeKey !== prevState.manualChangeKey || this.props.shouldUpdateAlways) {\\n this.props.onChangeInput(this.props.name, this.state.value);\\n }\\n }\\n }\",\n \"componentDidUpdate(preProps, preState, a) {\\n console.log('componentDidUpdate', a);\\n\\n }\",\n \"_requestUpdate(e,t){let n=!0;// If we have a property key, perform property update steps.\\nif(e!==void 0){const r=this.constructor,a=r._classProperties.get(e)||defaultPropertyDeclaration;r._valueHasChanged(this[e],t,a.hasChanged)?(!this._changedProperties.has(e)&&this._changedProperties.set(e,t),!0===a.reflect&&!(this._updateState&STATE_IS_REFLECTING_TO_PROPERTY)&&(this._reflectingProperties===void 0&&(this._reflectingProperties=new Map),this._reflectingProperties.set(e,a))):n=!1}!this._hasRequestedUpdate&&n&&this._enqueueUpdate()}\",\n \"_onChange() {\\n this.setState(getUserState());\\n }\",\n \"componentWillUpdate(){\\n }\",\n \"update() {\\n throw new Error(\\\"Not Implemented\\\");\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7217204","0.67610246","0.66769236","0.66106635","0.6540022","0.65259355","0.6489663","0.64705694","0.645821","0.63847154","0.6354757","0.63347685","0.63053316","0.6304944","0.62717897","0.6266675","0.621649","0.6214279","0.6194085","0.6189877","0.61581206","0.61456084","0.61447406","0.6142352","0.61391985","0.6136819","0.6136819","0.6126794","0.6124326","0.6123324","0.6123313","0.61184245","0.61128074","0.6111048","0.6095896","0.60895276","0.60835844","0.605533","0.6054009","0.60441685","0.603602","0.60313237","0.6023746","0.6022422","0.6013368","0.6011896","0.5998191","0.5996584","0.5989578","0.5989578","0.59868217","0.5978034","0.59710664","0.59678763","0.5959723","0.59404993","0.5940022","0.5929913","0.5929369","0.5926322","0.5901044","0.5899439","0.58905244","0.588635","0.58777153","0.58744425","0.58717144","0.58670866","0.58630913","0.58609957","0.5854311","0.5852806","0.58316416","0.5830537","0.58260363","0.58244467","0.58180845","0.58180845","0.58161324","0.5805007","0.58019525","0.58012426","0.58001685","0.5799195","0.57960683","0.57954085","0.5794681","0.57944787","0.5790454","0.578807","0.57828015","0.57828015","0.5779781","0.57756954","0.57737005","0.5773495","0.576855","0.57582575","0.5755969","0.57503283","0.574594"],"string":"[\n \"0.7217204\",\n \"0.67610246\",\n \"0.66769236\",\n \"0.66106635\",\n \"0.6540022\",\n \"0.65259355\",\n \"0.6489663\",\n \"0.64705694\",\n \"0.645821\",\n \"0.63847154\",\n \"0.6354757\",\n \"0.63347685\",\n \"0.63053316\",\n \"0.6304944\",\n \"0.62717897\",\n \"0.6266675\",\n \"0.621649\",\n \"0.6214279\",\n \"0.6194085\",\n \"0.6189877\",\n \"0.61581206\",\n \"0.61456084\",\n \"0.61447406\",\n \"0.6142352\",\n \"0.61391985\",\n \"0.6136819\",\n \"0.6136819\",\n \"0.6126794\",\n \"0.6124326\",\n \"0.6123324\",\n \"0.6123313\",\n \"0.61184245\",\n \"0.61128074\",\n \"0.6111048\",\n \"0.6095896\",\n \"0.60895276\",\n \"0.60835844\",\n \"0.605533\",\n \"0.6054009\",\n \"0.60441685\",\n \"0.603602\",\n \"0.60313237\",\n \"0.6023746\",\n \"0.6022422\",\n \"0.6013368\",\n \"0.6011896\",\n \"0.5998191\",\n \"0.5996584\",\n \"0.5989578\",\n \"0.5989578\",\n \"0.59868217\",\n \"0.5978034\",\n \"0.59710664\",\n \"0.59678763\",\n \"0.5959723\",\n \"0.59404993\",\n \"0.5940022\",\n \"0.5929913\",\n \"0.5929369\",\n \"0.5926322\",\n \"0.5901044\",\n \"0.5899439\",\n \"0.58905244\",\n \"0.588635\",\n \"0.58777153\",\n \"0.58744425\",\n \"0.58717144\",\n \"0.58670866\",\n \"0.58630913\",\n \"0.58609957\",\n \"0.5854311\",\n \"0.5852806\",\n \"0.58316416\",\n \"0.5830537\",\n \"0.58260363\",\n \"0.58244467\",\n \"0.58180845\",\n \"0.58180845\",\n \"0.58161324\",\n \"0.5805007\",\n \"0.58019525\",\n \"0.58012426\",\n \"0.58001685\",\n \"0.5799195\",\n \"0.57960683\",\n \"0.57954085\",\n \"0.5794681\",\n \"0.57944787\",\n \"0.5790454\",\n \"0.578807\",\n \"0.57828015\",\n \"0.57828015\",\n \"0.5779781\",\n \"0.57756954\",\n \"0.57737005\",\n \"0.5773495\",\n \"0.576855\",\n \"0.57582575\",\n \"0.5755969\",\n \"0.57503283\",\n \"0.574594\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5797,"cells":{"query":{"kind":"string","value":"Convenience component with default shallow equality check for sCU."},"document":{"kind":"string","value":"function PureComponent(props, context, updater) {\n this.props = props;\n this.context = context;\n this.refs = emptyObject;\n this.updater = updater || ReactNoopUpdateQueue;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function useStrictEquality(b, a) {\n return a === b;\n }","get shallowCopy() {\n return this.shallowCopy$();\n }","function defaultEqualityCheck(a, b) {\n return !a && !b || a === b;\n }","equals() {\n return false;\n }","equals() {\n return false;\n }","function looseEqual(a, b) {\n return true;\n }","Equals() {\n\n }","Equals() {\n\n }","function areEqualShallow(a, b) {\n var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\n _ref$ignore = _ref.ignore,\n ignore = _ref$ignore === undefined ? {} : _ref$ignore;\n\n if (a === b) {\n return true;\n }\n\n if ((typeof a === 'undefined' ? 'undefined' : _typeof(a)) !== 'object' || a === null || (typeof b === 'undefined' ? 'undefined' : _typeof(b)) !== 'object' || b === null) {\n return false;\n }\n\n if (Object.keys(a).length !== Object.keys(b).length) {\n return false;\n }\n\n for (var key in a) {\n if (!(key in ignore) && (!(key in b) || a[key] !== b[key])) {\n return false;\n }\n }\n for (var _key in b) {\n if (!(_key in ignore) && !(_key in a)) {\n return false;\n }\n }\n return true;\n}","function useStrictEquality( b, a ) {\n\t\t\t\tif ( b instanceof a.constructor || a instanceof b.constructor ) {\n\t\t\t\t\t// to catch short annotaion VS 'new' annotation of a\n\t\t\t\t\t// declaration\n\t\t\t\t\t// e.g. var i = 1;\n\t\t\t\t\t// var j = new Number(1);\n\t\t\t\t\treturn a == b;\n\t\t\t\t} else {\n\t\t\t\t\treturn a === b;\n\t\t\t\t}\n\t\t\t}","function useStrictEquality(b, a) {\n\t\t\tif (b instanceof a.constructor || a instanceof b.constructor) {\n\t\t\t\t// to catch short annotaion VS 'new' annotation of a declaration\n\t\t\t\t// e.g. var i = 1;\n\t\t\t\t// var j = new Number(1);\n\t\t\t\treturn a == b;\n\t\t\t} else {\n\t\t\t\treturn a === b;\n\t\t\t}\n\t\t}","function callObjectEqual(a, b) {\n if (!isDefaultMode() && !canTestPrimitiveScope) {\n // If the environment doesn't allow null scope, then there's no way\n // to predict how the scope will be mangled by running \"a\" through it,\n // so run isEqual as a static method instead. This is simulating a real\n // world situation as well as there is no way to map isEqual to Object\n // prototype and have it work for string primitives when strict mode is\n // not available, so the user will in that case have to go through the\n // static method as well. Similarly, chainables would have to go through\n // a significant tapdance to get working right with null scope issues,\n // and the performance penalties and indescrepancy with extended mode\n // is not worth the benefits.\n return run(Object, 'isEqual', [a, b]);\n }\n return run(a, 'isEqual', [b]);\n }","function useStrictEquality(b, a) {\n if (b instanceof a.constructor || a instanceof b.constructor) {\n // to catch short annotaion VS 'new' annotation of a declaration\n // e.g. var i = 1;\n // var j = new Number(1);\n return a == b;\n } else {\n return a === b;\n }\n }","function useStrictEquality(b, a) {\n if (b instanceof a.constructor || a instanceof b.constructor) {\n // to catch short annotaion VS 'new' annotation of a declaration\n // e.g. var i = 1;\n // var j = new Number(1);\n return a == b;\n } else {\n return a === b;\n }\n }","function looseEqual (a, b) {\n\t /* eslint-disable eqeqeq */\n\t return a == b || (\n\t isObject(a) && isObject(b)\n\t ? JSON.stringify(a) === JSON.stringify(b)\n\t : false\n\t )\n\t /* eslint-enable eqeqeq */\n\t}","function looseEqual (a, b) {\n\t /* eslint-disable eqeqeq */\n\t return a == b || (\n\t isObject(a) && isObject(b)\n\t ? JSON.stringify(a) === JSON.stringify(b)\n\t : false\n\t )\n\t /* eslint-enable eqeqeq */\n\t}","function looseEqual (a, b) {\n\t /* eslint-disable eqeqeq */\n\t return a == b || (\n\t isObject(a) && isObject(b)\n\t ? JSON.stringify(a) === JSON.stringify(b)\n\t : false\n\t )\n\t /* eslint-enable eqeqeq */\n\t}","function looseEqual (a, b) {\n /* eslint-disable eqeqeq */\n return a == b || (\n isObject(a) && isObject(b)\n ? JSON.stringify(a) === JSON.stringify(b)\n : false\n )\n /* eslint-enable eqeqeq */\n}","function looseEqual (a, b) {\n /* eslint-disable eqeqeq */\n return a == b || (\n isObject(a) && isObject(b)\n ? JSON.stringify(a) === JSON.stringify(b)\n : false\n )\n /* eslint-enable eqeqeq */\n}","function shallowCompare(instance,nextProps,nextState){return!shallowEqual(instance.props,nextProps)||!shallowEqual(instance.state,nextState);}","equals(S) {\n return XSet.equality(this.S);\n }","_equal(a, b) {\n return a === b;\n }","isEqual(currentValue, newValue) {\n throw new Error(\"Abstract method\");\n }","function looseEqual(a,b){var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){return JSON.stringify(a)===JSON.stringify(b);}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}","function shallowCompare(instance, nextProps, nextState) {\n\t\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t\t}","function checkEquality(a, b) {\n return a === b;\n }","isEqual(x, y) {\n return this.x === x && this.y === y;\n }","eq(other) { return this == other; }","function eq(a, b) {\n return a === b;\n }","function sameObject(a, b) {\n return a === b\n}","eq_(one, another) {\n return one === another;\n }","function shallowCompare(instance, nextProps, nextState) {\n\t\t\treturn !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t\t}","function isCoerced(a,b) {\n if (a===b) {\n return false\n } else if(a==b){\n return true\n } else if (a !=b) {\n return false\n }\n}","function looseEqual (a, b) {\n\t var isObjectA = isObject(a);\n\t var isObjectB = isObject(b);\n\t if (isObjectA && isObjectB) {\n\t try {\n\t return JSON.stringify(a) === JSON.stringify(b)\n\t } catch (e) {\n\t // possible circular reference\n\t return a === b\n\t }\n\t } else if (!isObjectA && !isObjectB) {\n\t return String(a) === String(b)\n\t } else {\n\t return false\n\t }\n\t}","function looseEqual (a, b) {\n\t var isObjectA = isObject(a);\n\t var isObjectB = isObject(b);\n\t if (isObjectA && isObjectB) {\n\t try {\n\t return JSON.stringify(a) === JSON.stringify(b)\n\t } catch (e) {\n\t // possible circular reference\n\t return a === b\n\t }\n\t } else if (!isObjectA && !isObjectB) {\n\t return String(a) === String(b)\n\t } else {\n\t return false\n\t }\n\t}","function looseEqual (a, b) {\n\t var isObjectA = isObject(a);\n\t var isObjectB = isObject(b);\n\t if (isObjectA && isObjectB) {\n\t try {\n\t return JSON.stringify(a) === JSON.stringify(b)\n\t } catch (e) {\n\t // possible circular reference\n\t return a === b\n\t }\n\t } else if (!isObjectA && !isObjectB) {\n\t return String(a) === String(b)\n\t } else {\n\t return false\n\t }\n\t}","function _equals(a, b) {\n if (a === b || (a !== a && b !== b)) { // true for NaNs\n return true;\n }\n\n if (!a || !b) {\n return false;\n }\n\n // There is probably a cleaner way to do this check\n // Blame TDD :)\n if (a && typeof a.constructor === 'function' &&\n a.constructor.unionFactory === Union) {\n if (!(b && typeof b.constructor === 'function' &&\n b.constructor.unionFactory === Union)) {\n return false;\n }\n if (a.constructor !== b.constructor) {\n return false;\n }\n if (a.name !== b.name) {\n return false;\n }\n return _equals(a.payload, b.payload);\n }\n\n // I hate this block. Blame immutablejs :)\n if (typeof a.valueOf === 'function' &&\n typeof b.valueOf === 'function') {\n a = a.valueOf();\n b = b.valueOf();\n if (a === b || (a !== a && b !== b)) {\n return true;\n }\n if (!a || !b) {\n return false;\n }\n }\n if (typeof a.equals === 'function' &&\n typeof b.equals === 'function') {\n return a.equals(b);\n }\n return false;\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b)\n } catch (e) {\n // possible circular reference\n return a === b\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function StrictEqualityComparer(x, y) {\n return x === y;\n}","function looseEqual (a, b) {\n\t var isObjectA = isObject(a);\n\t var isObjectB = isObject(b);\n\t if (isObjectA && isObjectB) {\n\t return JSON.stringify(a) === JSON.stringify(b)\n\t } else if (!isObjectA && !isObjectB) {\n\t return String(a) === String(b)\n\t } else {\n\t return false\n\t }\n\t}","function looseEqual (a, b) {\n\t var isObjectA = isObject(a);\n\t var isObjectB = isObject(b);\n\t if (isObjectA && isObjectB) {\n\t return JSON.stringify(a) === JSON.stringify(b)\n\t } else if (!isObjectA && !isObjectB) {\n\t return String(a) === String(b)\n\t } else {\n\t return false\n\t }\n\t}","isEqual(other) {\n if (!other) {\n return false;\n } else {\n return equals(this.underlying, other.underlying);\n }\n }","function printSomthingWorthless(){\r\n console.log('my object is does(not) equal to cole');\r\n console.log(this === cole);\r\n}","function looseEqual(a, b) {\n\t var isObjectA = isObject(a);\n\t var isObjectB = isObject(b);\n\t if (isObjectA && isObjectB) {\n\t try {\n\t return JSON.stringify(a) === JSON.stringify(b);\n\t } catch (e) {\n\t // possible circular reference\n\t return a === b;\n\t }\n\t } else if (!isObjectA && !isObjectB) {\n\t return String(a) === String(b);\n\t } else {\n\t return false;\n\t }\n\t}","isObjectEqual(a, b) {\n return a && b && a.foo === b.foo;\n }","function looseEqual(a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n try {\n return JSON.stringify(a) === JSON.stringify(b);\n } catch (e) {\n // possible circular reference\n return a === b;\n }\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b);\n } else {\n return false;\n }\n}","get d812() { return this.c1.same(this.c8) && this.c2.same(this.c8) }","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n return JSON.stringify(a) === JSON.stringify(b)\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n return JSON.stringify(a) === JSON.stringify(b)\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n return JSON.stringify(a) === JSON.stringify(b)\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n return JSON.stringify(a) === JSON.stringify(b)\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual (a, b) {\n var isObjectA = isObject(a);\n var isObjectB = isObject(b);\n if (isObjectA && isObjectB) {\n return JSON.stringify(a) === JSON.stringify(b)\n } else if (!isObjectA && !isObjectB) {\n return String(a) === String(b)\n } else {\n return false\n }\n}","function looseEqual(a, b) {\n\t var isObjectA = isObject(a);\n\t var isObjectB = isObject(b);\n\t if (isObjectA && isObjectB) {\n\t return JSON.stringify(a) === JSON.stringify(b);\n\t } else if (!isObjectA && !isObjectB) {\n\t return String(a) === String(b);\n\t } else {\n\t return false;\n\t }\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function shallowCompare(instance, nextProps, nextState) {\n\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\n\t}","function strictEquals(a) {\n return b => a === b;\n}","function sc_isEqual(o1, o2) {\n return ((o1 === o2) ||\n\t (sc_isPair(o1) && sc_isPair(o2)\n\t && sc_isPairEqual(o1, o2, sc_isEqual)) ||\n\t (sc_isVector(o1) && sc_isVector(o2)\n\t && sc_isVectorEqual(o1, o2, sc_isEqual)));\n}","function eq(x, y) {\n return util.inspect(x, true, null) === util.inspect(y, true, null);\n }","function shallowCompare(a, b) {\r\n return checkProperties(a, b) && checkProperties(b, a);\r\n}","function shallowCompare(a, b) {\r\n return checkProperties(a, b) && checkProperties(b, a);\r\n}","eq(other) { return false; }","isEqual(other, ignoreAttrs = ['_id', '_rev'], strict = false) {\n return isEqualWith(\n omit(this, ignoreAttrs),\n omit(other, ignoreAttrs),\n !strict && looseDates\n )\n }","function defaultEquals(a, b) {\n return a === b;\n }","function looseEqual(a,b){if(a===b){return true;}var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){try{var isArrayA=Array.isArray(a);var isArrayB=Array.isArray(b);if(isArrayA&&isArrayB){return a.length===b.length&&a.every(function(e,i){return looseEqual(e,b[i]);});}else if(!isArrayA&&!isArrayB){var keysA=Object.keys(a);var keysB=Object.keys(b);return keysA.length===keysB.length&&keysA.every(function(key){return looseEqual(a[key],b[key]);});}else{/* istanbul ignore next */return false;}}catch(e){/* istanbul ignore next */return false;}}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}","function looseEqual(a,b){if(a===b){return true;}var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){try{var isArrayA=Array.isArray(a);var isArrayB=Array.isArray(b);if(isArrayA&&isArrayB){return a.length===b.length&&a.every(function(e,i){return looseEqual(e,b[i]);});}else if(!isArrayA&&!isArrayB){var keysA=Object.keys(a);var keysB=Object.keys(b);return keysA.length===keysB.length&&keysA.every(function(key){return looseEqual(a[key],b[key]);});}else{/* istanbul ignore next */return false;}}catch(e){/* istanbul ignore next */return false;}}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}","function isEqual(a, b) {\n if (typeof a === 'function' && typeof b === 'function') {\n return true;\n }\n\n if ((0, _react.isValidElement)(a) && (0, _react.isValidElement)(b)) {\n return true;\n }\n\n if (a instanceof Array && b instanceof Array) {\n if (a.length !== b.length) {\n return false;\n }\n\n for (var i = 0; i !== a.length; i++) {\n if (!isEqual(a[i], b[i])) {\n return false;\n }\n }\n\n return true;\n }\n\n if (isObject(a) && isObject(b)) {\n if (Object.keys(a).length !== Object.keys(b).length) {\n return false;\n }\n\n for (var _i3 = 0, _Object$keys = Object.keys(a); _i3 < _Object$keys.length; _i3++) {\n var key = _Object$keys[_i3];\n\n if (!isEqual(a[key], b[key])) {\n return false;\n }\n }\n\n return true;\n }\n\n return a === b;\n}","function equal$1(a,b){// START: fast-deep-equal es6/index.js 3.1.1\nif(a===b)return true;if(a&&b&&typeof a=='object'&&typeof b=='object'){if(a.constructor!==b.constructor)return false;var length,i,keys;if(Array.isArray(a)){length=a.length;if(length!=b.length)return false;for(i=length;i--!==0;)if(!equal$1(a[i],b[i]))return false;return true;}// START: Modifications:\n// 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\n// to co-exist with es5.\n// 2. Replace `for of` with es5 compliant iteration using `for`.\n// Basically, take:\n//\n// ```js\n// for (i of a.entries())\n// if (!b.has(i[0])) return false;\n// ```\n//\n// ... and convert to:\n//\n// ```js\n// it = a.entries();\n// while (!(i = it.next()).done)\n// if (!b.has(i.value[0])) return false;\n// ```\n//\n// **Note**: `i` access switches to `i.value`.\nvar it;if(hasMap&&a instanceof Map&&b instanceof Map){if(a.size!==b.size)return false;it=a.entries();while(!(i=it.next()).done)if(!b.has(i.value[0]))return false;it=a.entries();while(!(i=it.next()).done)if(!equal$1(i.value[1],b.get(i.value[0])))return false;return true;}if(hasSet&&a instanceof Set&&b instanceof Set){if(a.size!==b.size)return false;it=a.entries();while(!(i=it.next()).done)if(!b.has(i.value[0]))return false;return true;}// END: Modifications\nif(hasArrayBuffer&&ArrayBuffer.isView(a)&&ArrayBuffer.isView(b)){length=a.length;if(length!=b.length)return false;for(i=length;i--!==0;)if(a[i]!==b[i])return false;return true;}if(a.constructor===RegExp)return a.source===b.source&&a.flags===b.flags;if(a.valueOf!==Object.prototype.valueOf)return a.valueOf()===b.valueOf();if(a.toString!==Object.prototype.toString)return a.toString()===b.toString();keys=Object.keys(a);length=keys.length;if(length!==Object.keys(b).length)return false;for(i=length;i--!==0;)if(!Object.prototype.hasOwnProperty.call(b,keys[i]))return false;// END: fast-deep-equal\n// START: react-fast-compare\n// custom handling for DOM elements\nif(hasElementType&&a instanceof Element)return false;// custom handling for React/Preact\nfor(i=length;i--!==0;){if((keys[i]==='_owner'||keys[i]==='__v'||keys[i]==='__o')&&a.$$typeof){// React-specific: avoid traversing React elements' _owner\n// Preact-specific: avoid traversing Preact elements' __v and __o\n// __v = $_original / $_vnode\n// __o = $_owner\n// These properties contain circular references and are not needed when\n// comparing the actual elements (and not their owners)\n// .$$typeof and ._store on just reasonable markers of elements\ncontinue;}// all other properties should be traversed as usual\nif(!equal$1(a[keys[i]],b[keys[i]]))return false;}// END: react-fast-compare\n// START: fast-deep-equal\nreturn true;}return a!==a&&b!==b;}// end fast-deep-equal","function sameValue(a, b) {\n return a == b\n}","static EqualContents() {}","function $i__NM$$fbjs$lib$shallowEqual__is(x, y) {\n // SameValue algorithm\n if (x === y) {\n // Steps 1-5, 7-10\n // Steps 6.b-6.e: +0 != -0\n // Added the nonzero y check to make Flow happy, but it is redundant\n return x !== 0 || y !== 0 || 1 / x === 1 / y;\n } else {\n // Step 6.a: NaN == NaN\n return x !== x && y !== y;\n }\n}","function shallowEqual(objA,objB){if(is(objA,objB)){return true;}if((typeof objA==='undefined'?'undefined':_typeof(objA))!=='object'||objA===null||(typeof objB==='undefined'?'undefined':_typeof(objB))!=='object'||objB===null){return false;}var keysA=Object.keys(objA);var keysB=Object.keys(objB);if(keysA.length!==keysB.length){return false;}// Test for A's keys different from B.\nfor(var i=0;i<keysA.length;i++){if(!hasOwnProperty.call(objB,keysA[i])||!is(objA[keysA[i]],objB[keysA[i]])){return false;}}return true;}","function ComparedObject(value) {\n this.value = value;\n }","function immutableObjectTest(){\n\nlet test= {'name': 'vishal', 'age':27};\n//Object.freeze(test);\nlet test2= test;\n\ntest.age = 26;\nconsole.log(test);\nconsole.log(test2);\nconsole.log(test === test2);\n\n\n\n\n}","function sameValue(a, b) {\n return a === b\n}","function shallowCompare(a, b) {\n return checkProperties(a, b) && checkProperties(b, a);\n}","function shallowCompare(a, b) {\n return checkProperties(a, b) && checkProperties(b, a);\n}","function shallowCompare(a, b) {\n return checkProperties(a, b) && checkProperties(b, a);\n}","function shallowCompare(a, b) {\n return checkProperties(a, b) && checkProperties(b, a);\n}","function shallowEqual(objA,objB){if(is(objA,objB)){return true;}if((typeof objA==='undefined'?'undefined':_typeof(objA))!=='object'||objA===null||(typeof objB==='undefined'?'undefined':_typeof(objB))!=='object'||objB===null){return false;}var keysA=Object.keys(objA);var keysB=Object.keys(objB);if(keysA.length!==keysB.length){return false;}// Test for A's keys different from B.\nfor(var i=0;i<keysA.length;i++){if(!hasOwnProperty$1.call(objB,keysA[i])||!is(objA[keysA[i]],objB[keysA[i]])){return false;}}return true;}","function defaultCheckValueEquality (a, b) {\n return a === b;\n}","function defaultCheckValueEquality (a, b) {\n return a === b;\n}","isEqual(comp) {\n return this.die1 === comp.die1 && this.die2 === comp.die2;\n }"],"string":"[\n \"function useStrictEquality(b, a) {\\n return a === b;\\n }\",\n \"get shallowCopy() {\\n return this.shallowCopy$();\\n }\",\n \"function defaultEqualityCheck(a, b) {\\n return !a && !b || a === b;\\n }\",\n \"equals() {\\n return false;\\n }\",\n \"equals() {\\n return false;\\n }\",\n \"function looseEqual(a, b) {\\n return true;\\n }\",\n \"Equals() {\\n\\n }\",\n \"Equals() {\\n\\n }\",\n \"function areEqualShallow(a, b) {\\n var _ref = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {},\\n _ref$ignore = _ref.ignore,\\n ignore = _ref$ignore === undefined ? {} : _ref$ignore;\\n\\n if (a === b) {\\n return true;\\n }\\n\\n if ((typeof a === 'undefined' ? 'undefined' : _typeof(a)) !== 'object' || a === null || (typeof b === 'undefined' ? 'undefined' : _typeof(b)) !== 'object' || b === null) {\\n return false;\\n }\\n\\n if (Object.keys(a).length !== Object.keys(b).length) {\\n return false;\\n }\\n\\n for (var key in a) {\\n if (!(key in ignore) && (!(key in b) || a[key] !== b[key])) {\\n return false;\\n }\\n }\\n for (var _key in b) {\\n if (!(_key in ignore) && !(_key in a)) {\\n return false;\\n }\\n }\\n return true;\\n}\",\n \"function useStrictEquality( b, a ) {\\n\\t\\t\\t\\tif ( b instanceof a.constructor || a instanceof b.constructor ) {\\n\\t\\t\\t\\t\\t// to catch short annotaion VS 'new' annotation of a\\n\\t\\t\\t\\t\\t// declaration\\n\\t\\t\\t\\t\\t// e.g. var i = 1;\\n\\t\\t\\t\\t\\t// var j = new Number(1);\\n\\t\\t\\t\\t\\treturn a == b;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\treturn a === b;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"function useStrictEquality(b, a) {\\n\\t\\t\\tif (b instanceof a.constructor || a instanceof b.constructor) {\\n\\t\\t\\t\\t// to catch short annotaion VS 'new' annotation of a declaration\\n\\t\\t\\t\\t// e.g. var i = 1;\\n\\t\\t\\t\\t// var j = new Number(1);\\n\\t\\t\\t\\treturn a == b;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn a === b;\\n\\t\\t\\t}\\n\\t\\t}\",\n \"function callObjectEqual(a, b) {\\n if (!isDefaultMode() && !canTestPrimitiveScope) {\\n // If the environment doesn't allow null scope, then there's no way\\n // to predict how the scope will be mangled by running \\\"a\\\" through it,\\n // so run isEqual as a static method instead. This is simulating a real\\n // world situation as well as there is no way to map isEqual to Object\\n // prototype and have it work for string primitives when strict mode is\\n // not available, so the user will in that case have to go through the\\n // static method as well. Similarly, chainables would have to go through\\n // a significant tapdance to get working right with null scope issues,\\n // and the performance penalties and indescrepancy with extended mode\\n // is not worth the benefits.\\n return run(Object, 'isEqual', [a, b]);\\n }\\n return run(a, 'isEqual', [b]);\\n }\",\n \"function useStrictEquality(b, a) {\\n if (b instanceof a.constructor || a instanceof b.constructor) {\\n // to catch short annotaion VS 'new' annotation of a declaration\\n // e.g. var i = 1;\\n // var j = new Number(1);\\n return a == b;\\n } else {\\n return a === b;\\n }\\n }\",\n \"function useStrictEquality(b, a) {\\n if (b instanceof a.constructor || a instanceof b.constructor) {\\n // to catch short annotaion VS 'new' annotation of a declaration\\n // e.g. var i = 1;\\n // var j = new Number(1);\\n return a == b;\\n } else {\\n return a === b;\\n }\\n }\",\n \"function looseEqual (a, b) {\\n\\t /* eslint-disable eqeqeq */\\n\\t return a == b || (\\n\\t isObject(a) && isObject(b)\\n\\t ? JSON.stringify(a) === JSON.stringify(b)\\n\\t : false\\n\\t )\\n\\t /* eslint-enable eqeqeq */\\n\\t}\",\n \"function looseEqual (a, b) {\\n\\t /* eslint-disable eqeqeq */\\n\\t return a == b || (\\n\\t isObject(a) && isObject(b)\\n\\t ? JSON.stringify(a) === JSON.stringify(b)\\n\\t : false\\n\\t )\\n\\t /* eslint-enable eqeqeq */\\n\\t}\",\n \"function looseEqual (a, b) {\\n\\t /* eslint-disable eqeqeq */\\n\\t return a == b || (\\n\\t isObject(a) && isObject(b)\\n\\t ? JSON.stringify(a) === JSON.stringify(b)\\n\\t : false\\n\\t )\\n\\t /* eslint-enable eqeqeq */\\n\\t}\",\n \"function looseEqual (a, b) {\\n /* eslint-disable eqeqeq */\\n return a == b || (\\n isObject(a) && isObject(b)\\n ? JSON.stringify(a) === JSON.stringify(b)\\n : false\\n )\\n /* eslint-enable eqeqeq */\\n}\",\n \"function looseEqual (a, b) {\\n /* eslint-disable eqeqeq */\\n return a == b || (\\n isObject(a) && isObject(b)\\n ? JSON.stringify(a) === JSON.stringify(b)\\n : false\\n )\\n /* eslint-enable eqeqeq */\\n}\",\n \"function shallowCompare(instance,nextProps,nextState){return!shallowEqual(instance.props,nextProps)||!shallowEqual(instance.state,nextState);}\",\n \"equals(S) {\\n return XSet.equality(this.S);\\n }\",\n \"_equal(a, b) {\\n return a === b;\\n }\",\n \"isEqual(currentValue, newValue) {\\n throw new Error(\\\"Abstract method\\\");\\n }\",\n \"function looseEqual(a,b){var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){return JSON.stringify(a)===JSON.stringify(b);}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t\\t}\",\n \"function checkEquality(a, b) {\\n return a === b;\\n }\",\n \"isEqual(x, y) {\\n return this.x === x && this.y === y;\\n }\",\n \"eq(other) { return this == other; }\",\n \"function eq(a, b) {\\n return a === b;\\n }\",\n \"function sameObject(a, b) {\\n return a === b\\n}\",\n \"eq_(one, another) {\\n return one === another;\\n }\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t\\t\\treturn !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t\\t}\",\n \"function isCoerced(a,b) {\\n if (a===b) {\\n return false\\n } else if(a==b){\\n return true\\n } else if (a !=b) {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n\\t var isObjectA = isObject(a);\\n\\t var isObjectB = isObject(b);\\n\\t if (isObjectA && isObjectB) {\\n\\t try {\\n\\t return JSON.stringify(a) === JSON.stringify(b)\\n\\t } catch (e) {\\n\\t // possible circular reference\\n\\t return a === b\\n\\t }\\n\\t } else if (!isObjectA && !isObjectB) {\\n\\t return String(a) === String(b)\\n\\t } else {\\n\\t return false\\n\\t }\\n\\t}\",\n \"function looseEqual (a, b) {\\n\\t var isObjectA = isObject(a);\\n\\t var isObjectB = isObject(b);\\n\\t if (isObjectA && isObjectB) {\\n\\t try {\\n\\t return JSON.stringify(a) === JSON.stringify(b)\\n\\t } catch (e) {\\n\\t // possible circular reference\\n\\t return a === b\\n\\t }\\n\\t } else if (!isObjectA && !isObjectB) {\\n\\t return String(a) === String(b)\\n\\t } else {\\n\\t return false\\n\\t }\\n\\t}\",\n \"function looseEqual (a, b) {\\n\\t var isObjectA = isObject(a);\\n\\t var isObjectB = isObject(b);\\n\\t if (isObjectA && isObjectB) {\\n\\t try {\\n\\t return JSON.stringify(a) === JSON.stringify(b)\\n\\t } catch (e) {\\n\\t // possible circular reference\\n\\t return a === b\\n\\t }\\n\\t } else if (!isObjectA && !isObjectB) {\\n\\t return String(a) === String(b)\\n\\t } else {\\n\\t return false\\n\\t }\\n\\t}\",\n \"function _equals(a, b) {\\n if (a === b || (a !== a && b !== b)) { // true for NaNs\\n return true;\\n }\\n\\n if (!a || !b) {\\n return false;\\n }\\n\\n // There is probably a cleaner way to do this check\\n // Blame TDD :)\\n if (a && typeof a.constructor === 'function' &&\\n a.constructor.unionFactory === Union) {\\n if (!(b && typeof b.constructor === 'function' &&\\n b.constructor.unionFactory === Union)) {\\n return false;\\n }\\n if (a.constructor !== b.constructor) {\\n return false;\\n }\\n if (a.name !== b.name) {\\n return false;\\n }\\n return _equals(a.payload, b.payload);\\n }\\n\\n // I hate this block. Blame immutablejs :)\\n if (typeof a.valueOf === 'function' &&\\n typeof b.valueOf === 'function') {\\n a = a.valueOf();\\n b = b.valueOf();\\n if (a === b || (a !== a && b !== b)) {\\n return true;\\n }\\n if (!a || !b) {\\n return false;\\n }\\n }\\n if (typeof a.equals === 'function' &&\\n typeof b.equals === 'function') {\\n return a.equals(b);\\n }\\n return false;\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } catch (e) {\\n // possible circular reference\\n return a === b\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function StrictEqualityComparer(x, y) {\\n return x === y;\\n}\",\n \"function looseEqual (a, b) {\\n\\t var isObjectA = isObject(a);\\n\\t var isObjectB = isObject(b);\\n\\t if (isObjectA && isObjectB) {\\n\\t return JSON.stringify(a) === JSON.stringify(b)\\n\\t } else if (!isObjectA && !isObjectB) {\\n\\t return String(a) === String(b)\\n\\t } else {\\n\\t return false\\n\\t }\\n\\t}\",\n \"function looseEqual (a, b) {\\n\\t var isObjectA = isObject(a);\\n\\t var isObjectB = isObject(b);\\n\\t if (isObjectA && isObjectB) {\\n\\t return JSON.stringify(a) === JSON.stringify(b)\\n\\t } else if (!isObjectA && !isObjectB) {\\n\\t return String(a) === String(b)\\n\\t } else {\\n\\t return false\\n\\t }\\n\\t}\",\n \"isEqual(other) {\\n if (!other) {\\n return false;\\n } else {\\n return equals(this.underlying, other.underlying);\\n }\\n }\",\n \"function printSomthingWorthless(){\\r\\n console.log('my object is does(not) equal to cole');\\r\\n console.log(this === cole);\\r\\n}\",\n \"function looseEqual(a, b) {\\n\\t var isObjectA = isObject(a);\\n\\t var isObjectB = isObject(b);\\n\\t if (isObjectA && isObjectB) {\\n\\t try {\\n\\t return JSON.stringify(a) === JSON.stringify(b);\\n\\t } catch (e) {\\n\\t // possible circular reference\\n\\t return a === b;\\n\\t }\\n\\t } else if (!isObjectA && !isObjectB) {\\n\\t return String(a) === String(b);\\n\\t } else {\\n\\t return false;\\n\\t }\\n\\t}\",\n \"isObjectEqual(a, b) {\\n return a && b && a.foo === b.foo;\\n }\",\n \"function looseEqual(a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n try {\\n return JSON.stringify(a) === JSON.stringify(b);\\n } catch (e) {\\n // possible circular reference\\n return a === b;\\n }\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b);\\n } else {\\n return false;\\n }\\n}\",\n \"get d812() { return this.c1.same(this.c8) && this.c2.same(this.c8) }\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual (a, b) {\\n var isObjectA = isObject(a);\\n var isObjectB = isObject(b);\\n if (isObjectA && isObjectB) {\\n return JSON.stringify(a) === JSON.stringify(b)\\n } else if (!isObjectA && !isObjectB) {\\n return String(a) === String(b)\\n } else {\\n return false\\n }\\n}\",\n \"function looseEqual(a, b) {\\n\\t var isObjectA = isObject(a);\\n\\t var isObjectB = isObject(b);\\n\\t if (isObjectA && isObjectB) {\\n\\t return JSON.stringify(a) === JSON.stringify(b);\\n\\t } else if (!isObjectA && !isObjectB) {\\n\\t return String(a) === String(b);\\n\\t } else {\\n\\t return false;\\n\\t }\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function shallowCompare(instance, nextProps, nextState) {\\n\\t return !shallowEqual(instance.props, nextProps) || !shallowEqual(instance.state, nextState);\\n\\t}\",\n \"function strictEquals(a) {\\n return b => a === b;\\n}\",\n \"function sc_isEqual(o1, o2) {\\n return ((o1 === o2) ||\\n\\t (sc_isPair(o1) && sc_isPair(o2)\\n\\t && sc_isPairEqual(o1, o2, sc_isEqual)) ||\\n\\t (sc_isVector(o1) && sc_isVector(o2)\\n\\t && sc_isVectorEqual(o1, o2, sc_isEqual)));\\n}\",\n \"function eq(x, y) {\\n return util.inspect(x, true, null) === util.inspect(y, true, null);\\n }\",\n \"function shallowCompare(a, b) {\\r\\n return checkProperties(a, b) && checkProperties(b, a);\\r\\n}\",\n \"function shallowCompare(a, b) {\\r\\n return checkProperties(a, b) && checkProperties(b, a);\\r\\n}\",\n \"eq(other) { return false; }\",\n \"isEqual(other, ignoreAttrs = ['_id', '_rev'], strict = false) {\\n return isEqualWith(\\n omit(this, ignoreAttrs),\\n omit(other, ignoreAttrs),\\n !strict && looseDates\\n )\\n }\",\n \"function defaultEquals(a, b) {\\n return a === b;\\n }\",\n \"function looseEqual(a,b){if(a===b){return true;}var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){try{var isArrayA=Array.isArray(a);var isArrayB=Array.isArray(b);if(isArrayA&&isArrayB){return a.length===b.length&&a.every(function(e,i){return looseEqual(e,b[i]);});}else if(!isArrayA&&!isArrayB){var keysA=Object.keys(a);var keysB=Object.keys(b);return keysA.length===keysB.length&&keysA.every(function(key){return looseEqual(a[key],b[key]);});}else{/* istanbul ignore next */return false;}}catch(e){/* istanbul ignore next */return false;}}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}\",\n \"function looseEqual(a,b){if(a===b){return true;}var isObjectA=isObject(a);var isObjectB=isObject(b);if(isObjectA&&isObjectB){try{var isArrayA=Array.isArray(a);var isArrayB=Array.isArray(b);if(isArrayA&&isArrayB){return a.length===b.length&&a.every(function(e,i){return looseEqual(e,b[i]);});}else if(!isArrayA&&!isArrayB){var keysA=Object.keys(a);var keysB=Object.keys(b);return keysA.length===keysB.length&&keysA.every(function(key){return looseEqual(a[key],b[key]);});}else{/* istanbul ignore next */return false;}}catch(e){/* istanbul ignore next */return false;}}else if(!isObjectA&&!isObjectB){return String(a)===String(b);}else{return false;}}\",\n \"function isEqual(a, b) {\\n if (typeof a === 'function' && typeof b === 'function') {\\n return true;\\n }\\n\\n if ((0, _react.isValidElement)(a) && (0, _react.isValidElement)(b)) {\\n return true;\\n }\\n\\n if (a instanceof Array && b instanceof Array) {\\n if (a.length !== b.length) {\\n return false;\\n }\\n\\n for (var i = 0; i !== a.length; i++) {\\n if (!isEqual(a[i], b[i])) {\\n return false;\\n }\\n }\\n\\n return true;\\n }\\n\\n if (isObject(a) && isObject(b)) {\\n if (Object.keys(a).length !== Object.keys(b).length) {\\n return false;\\n }\\n\\n for (var _i3 = 0, _Object$keys = Object.keys(a); _i3 < _Object$keys.length; _i3++) {\\n var key = _Object$keys[_i3];\\n\\n if (!isEqual(a[key], b[key])) {\\n return false;\\n }\\n }\\n\\n return true;\\n }\\n\\n return a === b;\\n}\",\n \"function equal$1(a,b){// START: fast-deep-equal es6/index.js 3.1.1\\nif(a===b)return true;if(a&&b&&typeof a=='object'&&typeof b=='object'){if(a.constructor!==b.constructor)return false;var length,i,keys;if(Array.isArray(a)){length=a.length;if(length!=b.length)return false;for(i=length;i--!==0;)if(!equal$1(a[i],b[i]))return false;return true;}// START: Modifications:\\n// 1. Extra `has<Type> &&` helpers in initial condition allow es6 code\\n// to co-exist with es5.\\n// 2. Replace `for of` with es5 compliant iteration using `for`.\\n// Basically, take:\\n//\\n// ```js\\n// for (i of a.entries())\\n// if (!b.has(i[0])) return false;\\n// ```\\n//\\n// ... and convert to:\\n//\\n// ```js\\n// it = a.entries();\\n// while (!(i = it.next()).done)\\n// if (!b.has(i.value[0])) return false;\\n// ```\\n//\\n// **Note**: `i` access switches to `i.value`.\\nvar it;if(hasMap&&a instanceof Map&&b instanceof Map){if(a.size!==b.size)return false;it=a.entries();while(!(i=it.next()).done)if(!b.has(i.value[0]))return false;it=a.entries();while(!(i=it.next()).done)if(!equal$1(i.value[1],b.get(i.value[0])))return false;return true;}if(hasSet&&a instanceof Set&&b instanceof Set){if(a.size!==b.size)return false;it=a.entries();while(!(i=it.next()).done)if(!b.has(i.value[0]))return false;return true;}// END: Modifications\\nif(hasArrayBuffer&&ArrayBuffer.isView(a)&&ArrayBuffer.isView(b)){length=a.length;if(length!=b.length)return false;for(i=length;i--!==0;)if(a[i]!==b[i])return false;return true;}if(a.constructor===RegExp)return a.source===b.source&&a.flags===b.flags;if(a.valueOf!==Object.prototype.valueOf)return a.valueOf()===b.valueOf();if(a.toString!==Object.prototype.toString)return a.toString()===b.toString();keys=Object.keys(a);length=keys.length;if(length!==Object.keys(b).length)return false;for(i=length;i--!==0;)if(!Object.prototype.hasOwnProperty.call(b,keys[i]))return false;// END: fast-deep-equal\\n// START: react-fast-compare\\n// custom handling for DOM elements\\nif(hasElementType&&a instanceof Element)return false;// custom handling for React/Preact\\nfor(i=length;i--!==0;){if((keys[i]==='_owner'||keys[i]==='__v'||keys[i]==='__o')&&a.$$typeof){// React-specific: avoid traversing React elements' _owner\\n// Preact-specific: avoid traversing Preact elements' __v and __o\\n// __v = $_original / $_vnode\\n// __o = $_owner\\n// These properties contain circular references and are not needed when\\n// comparing the actual elements (and not their owners)\\n// .$$typeof and ._store on just reasonable markers of elements\\ncontinue;}// all other properties should be traversed as usual\\nif(!equal$1(a[keys[i]],b[keys[i]]))return false;}// END: react-fast-compare\\n// START: fast-deep-equal\\nreturn true;}return a!==a&&b!==b;}// end fast-deep-equal\",\n \"function sameValue(a, b) {\\n return a == b\\n}\",\n \"static EqualContents() {}\",\n \"function $i__NM$$fbjs$lib$shallowEqual__is(x, y) {\\n // SameValue algorithm\\n if (x === y) {\\n // Steps 1-5, 7-10\\n // Steps 6.b-6.e: +0 != -0\\n // Added the nonzero y check to make Flow happy, but it is redundant\\n return x !== 0 || y !== 0 || 1 / x === 1 / y;\\n } else {\\n // Step 6.a: NaN == NaN\\n return x !== x && y !== y;\\n }\\n}\",\n \"function shallowEqual(objA,objB){if(is(objA,objB)){return true;}if((typeof objA==='undefined'?'undefined':_typeof(objA))!=='object'||objA===null||(typeof objB==='undefined'?'undefined':_typeof(objB))!=='object'||objB===null){return false;}var keysA=Object.keys(objA);var keysB=Object.keys(objB);if(keysA.length!==keysB.length){return false;}// Test for A's keys different from B.\\nfor(var i=0;i<keysA.length;i++){if(!hasOwnProperty.call(objB,keysA[i])||!is(objA[keysA[i]],objB[keysA[i]])){return false;}}return true;}\",\n \"function ComparedObject(value) {\\n this.value = value;\\n }\",\n \"function immutableObjectTest(){\\n\\nlet test= {'name': 'vishal', 'age':27};\\n//Object.freeze(test);\\nlet test2= test;\\n\\ntest.age = 26;\\nconsole.log(test);\\nconsole.log(test2);\\nconsole.log(test === test2);\\n\\n\\n\\n\\n}\",\n \"function sameValue(a, b) {\\n return a === b\\n}\",\n \"function shallowCompare(a, b) {\\n return checkProperties(a, b) && checkProperties(b, a);\\n}\",\n \"function shallowCompare(a, b) {\\n return checkProperties(a, b) && checkProperties(b, a);\\n}\",\n \"function shallowCompare(a, b) {\\n return checkProperties(a, b) && checkProperties(b, a);\\n}\",\n \"function shallowCompare(a, b) {\\n return checkProperties(a, b) && checkProperties(b, a);\\n}\",\n \"function shallowEqual(objA,objB){if(is(objA,objB)){return true;}if((typeof objA==='undefined'?'undefined':_typeof(objA))!=='object'||objA===null||(typeof objB==='undefined'?'undefined':_typeof(objB))!=='object'||objB===null){return false;}var keysA=Object.keys(objA);var keysB=Object.keys(objB);if(keysA.length!==keysB.length){return false;}// Test for A's keys different from B.\\nfor(var i=0;i<keysA.length;i++){if(!hasOwnProperty$1.call(objB,keysA[i])||!is(objA[keysA[i]],objB[keysA[i]])){return false;}}return true;}\",\n \"function defaultCheckValueEquality (a, b) {\\n return a === b;\\n}\",\n \"function defaultCheckValueEquality (a, b) {\\n return a === b;\\n}\",\n \"isEqual(comp) {\\n return this.die1 === comp.die1 && this.die2 === comp.die2;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6083551","0.579784","0.5669391","0.56581414","0.56581414","0.5631642","0.55893344","0.55893344","0.55851346","0.5546245","0.548746","0.5484109","0.5481716","0.5481716","0.54722977","0.54722977","0.54722977","0.5451884","0.5451884","0.5441116","0.53989434","0.5390458","0.53734267","0.53614616","0.53444856","0.5330435","0.530434","0.5297544","0.52916396","0.5285837","0.5285182","0.52771044","0.5268669","0.52617186","0.52617186","0.52617186","0.5259976","0.52481365","0.52481365","0.52481365","0.52481365","0.52481365","0.52481365","0.52481365","0.52481365","0.52481365","0.52481365","0.52481365","0.5241399","0.5233564","0.5233564","0.5233387","0.52294236","0.5227296","0.5220631","0.52132595","0.5206488","0.5204139","0.5204139","0.5204139","0.5204139","0.5204139","0.51973444","0.5194291","0.5194291","0.5194291","0.5194291","0.5194291","0.5194291","0.5194291","0.5194291","0.5194291","0.5194291","0.5194291","0.5191664","0.51900935","0.51859164","0.5179292","0.5179292","0.51654994","0.51570237","0.51496154","0.5140876","0.5140876","0.5128853","0.51260805","0.5125106","0.5121707","0.5119484","0.51182693","0.51179624","0.51163673","0.5112509","0.51008964","0.51008964","0.51008964","0.51008964","0.50943255","0.50892746","0.50892746","0.5087915"],"string":"[\n \"0.6083551\",\n \"0.579784\",\n \"0.5669391\",\n \"0.56581414\",\n \"0.56581414\",\n \"0.5631642\",\n \"0.55893344\",\n \"0.55893344\",\n \"0.55851346\",\n \"0.5546245\",\n \"0.548746\",\n \"0.5484109\",\n \"0.5481716\",\n \"0.5481716\",\n \"0.54722977\",\n \"0.54722977\",\n \"0.54722977\",\n \"0.5451884\",\n \"0.5451884\",\n \"0.5441116\",\n \"0.53989434\",\n \"0.5390458\",\n \"0.53734267\",\n \"0.53614616\",\n \"0.53444856\",\n \"0.5330435\",\n \"0.530434\",\n \"0.5297544\",\n \"0.52916396\",\n \"0.5285837\",\n \"0.5285182\",\n \"0.52771044\",\n \"0.5268669\",\n \"0.52617186\",\n \"0.52617186\",\n \"0.52617186\",\n \"0.5259976\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.52481365\",\n \"0.5241399\",\n \"0.5233564\",\n \"0.5233564\",\n \"0.5233387\",\n \"0.52294236\",\n \"0.5227296\",\n \"0.5220631\",\n \"0.52132595\",\n \"0.5206488\",\n \"0.5204139\",\n \"0.5204139\",\n \"0.5204139\",\n \"0.5204139\",\n \"0.5204139\",\n \"0.51973444\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5194291\",\n \"0.5191664\",\n \"0.51900935\",\n \"0.51859164\",\n \"0.5179292\",\n \"0.5179292\",\n \"0.51654994\",\n \"0.51570237\",\n \"0.51496154\",\n \"0.5140876\",\n \"0.5140876\",\n \"0.5128853\",\n \"0.51260805\",\n \"0.5125106\",\n \"0.5121707\",\n \"0.5119484\",\n \"0.51182693\",\n \"0.51179624\",\n \"0.51163673\",\n \"0.5112509\",\n \"0.51008964\",\n \"0.51008964\",\n \"0.51008964\",\n \"0.51008964\",\n \"0.50943255\",\n \"0.50892746\",\n \"0.50892746\",\n \"0.5087915\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5798,"cells":{"query":{"kind":"string","value":"an immutable object with a single mutable value"},"document":{"kind":"string","value":"function createRef() {\n var refObject = {\n current: null\n };\n {\n Object.seal(refObject);\n }\n return refObject;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function immutableObjectTest(){\n\nlet test= {'name': 'vishal', 'age':27};\n//Object.freeze(test);\nlet test2= test;\n\ntest.age = 26;\nconsole.log(test);\nconsole.log(test2);\nconsole.log(test === test2);\n\n\n\n\n}","static set one(value) {}","function makeImmutableObject(obj) {\n\t if (!globalConfig.use_static) {\n\t addPropertyTo(obj, \"merge\", merge);\n\t addPropertyTo(obj, \"replace\", objectReplace);\n\t addPropertyTo(obj, \"without\", without);\n\t addPropertyTo(obj, \"asMutable\", asMutableObject);\n\t addPropertyTo(obj, \"set\", objectSet);\n\t addPropertyTo(obj, \"setIn\", objectSetIn);\n\t addPropertyTo(obj, \"update\", update);\n\t addPropertyTo(obj, \"updateIn\", updateIn);\n\t addPropertyTo(obj, \"getIn\", getIn);\n\t }\n\t\n\t return makeImmutable(obj, mutatingObjectMethods);\n\t }","function makeImmutableObject(obj) {\n\t if (!globalConfig.use_static) {\n\t addPropertyTo(obj, \"merge\", merge);\n\t addPropertyTo(obj, \"replace\", objectReplace);\n\t addPropertyTo(obj, \"without\", without);\n\t addPropertyTo(obj, \"asMutable\", asMutableObject);\n\t addPropertyTo(obj, \"set\", objectSet);\n\t addPropertyTo(obj, \"setIn\", objectSetIn);\n\t addPropertyTo(obj, \"update\", update);\n\t addPropertyTo(obj, \"updateIn\", updateIn);\n\t addPropertyTo(obj, \"getIn\", getIn);\n\t }\n\n\t return makeImmutable(obj, mutatingObjectMethods);\n\t }","function makeImmutableObject(obj) {\n\t if (!globalConfig.use_static) {\n\t addPropertyTo(obj, \"merge\", merge);\n\t addPropertyTo(obj, \"replace\", objectReplace);\n\t addPropertyTo(obj, \"without\", without);\n\t addPropertyTo(obj, \"asMutable\", asMutableObject);\n\t addPropertyTo(obj, \"set\", objectSet);\n\t addPropertyTo(obj, \"setIn\", objectSetIn);\n\t addPropertyTo(obj, \"update\", update);\n\t addPropertyTo(obj, \"updateIn\", updateIn);\n\t addPropertyTo(obj, \"getIn\", getIn);\n\t }\n\n\t return makeImmutable(obj, mutatingObjectMethods);\n\t }","function manipulationBareObj( value ) {\n\treturn value;\n}","function toImmutable(arg) {\n\t\t return (isImmutable(arg))\n\t\t ? arg\n\t\t : Immutable.fromJS(arg)\n\t\t}","function makeImmutableObject(obj) {\n if (!globalConfig.use_static) {\n addPropertyTo(obj, \"merge\", merge);\n addPropertyTo(obj, \"replace\", objectReplace);\n addPropertyTo(obj, \"without\", without);\n addPropertyTo(obj, \"asMutable\", asMutableObject);\n addPropertyTo(obj, \"set\", objectSet);\n addPropertyTo(obj, \"setIn\", objectSetIn);\n addPropertyTo(obj, \"update\", update);\n addPropertyTo(obj, \"updateIn\", updateIn);\n addPropertyTo(obj, \"getIn\", getIn);\n }\n\n return makeImmutable(obj, mutatingObjectMethods);\n }","function toImmutable(arg) {\n\t return (isImmutable(arg))\n\t ? arg\n\t : Immutable.fromJS(arg)\n\t}","function castImmutable(value) {\n return value;\n}","function set(obj, key, val, immutable) {\n if (immutable)\n return _set(assign({}, obj), key, val);\n return _set(obj, key, val);\n}","function constObjects() {\n const name = {\n person: \"reefath\"\n }\n \n name.person = \"tesla\"\n \n return name.person;\n}","function makeImmutableProperty (self, schema, values, propName) {\n var Model, dateCopy;\n\n if (schema[propName].__immutableCtor && is.function(schema[propName])) {\n // this is a nested immutable\n Model = schema[propName];\n self[propName] = new Model(values[propName]);\n } else if (isDate(values[propName])) {\n dateCopy = new Date(values[propName]);\n\n Object.defineProperty(self, propName, {\n get: function () {\n return new Date(dateCopy);\n },\n enumerable: true,\n configurable: false\n });\n\n Object.freeze(self[propName]);\n } else {\n objectHelper.setReadOnlyProperty(\n self,\n propName,\n // TODO: is it really necessary to clone the value if it isn't an object?\n objectHelper.copyValue(values[propName]),\n // typeof values[propName] === 'object' ? objectHelper.copyValue(values[propName]) : values[propName],\n makeSetHandler(propName)\n );\n\n if (Array.isArray(values[propName])) {\n Object.freeze(self[propName]);\n }\n }\n }","set(name, value) {\n return this.clone({\n name,\n value,\n op: 's'\n });\n }","set Baked(value) {}","set x(value = 42) {}","set x(value) {}","copyable(newValue = true) {\n this.value.copyable = newValue;\n return this;\n }","function put(obj, key, val, immutable) {\n if (immutable)\n return _put(assign({}, obj), key, val);\n return _put(obj, key, val);\n}","set(name, value) {\n return this.clone({ name, value, op: 's' });\n }","set(name, value) {\n return this.clone({ name, value, op: 's' });\n }","set(name, value) {\n return this.clone({ name, value, op: 's' });\n }","set(name, value) {\n return this.clone({ name, value, op: 's' });\n }","set(name, value) {\n return this.clone({ name, value, op: 's' });\n }","set(index, object) {\n return object;\n }","set value(value) {}","build() {\n const state = Immutable.from(this.state);\n this.setState(state);\n return state.asMutable();\n }","set(obj, value) {\n return this.update(obj, () => value);\n }","static foo (a) { return { ...a, b: 2 } }","function constantobjects() {\n const user = {\n name: \"John\"\n };\n\n console.log(user.name);\n\n // does it work? // yes\n user.name = \"Pete\";\n console.log(user.name);\n}","set(value) {\n if (value === this._value) {\n return this;\n }\n\n return new ImmutableAccessor(value, this.path);\n }","function example6() {\n var o = { a: 1 };\n o.a = 2; //allowed: change ref object\n o.b = 1; //allowed: change ref object\n\n // o = {a: 1} //not allowed: change referece itself\n}","static set zero(value) {}","copy() {\n return Object.assign(Object.create(this), JSON.parse(JSON.stringify(this)))\n }","set(v) { /* empty */ }","set(value) {\n this.value = value\n if (this.autoUpdate) {\n this.update()\n }\n return this // chain me up baby\n }","copy({ type = this.type, value = this.value } = {}) {\n const { id, lbp, rules, unknown, ignored } = this;\n return new this.constructor(id, {\n lbp,\n rules,\n unknown,\n ignored,\n type,\n value,\n original: this,\n });\n }","function identity(val){\n\t return val;\n\t }","one() {\r\n this.data.fill(0);\r\n this.data[0] = 1;\r\n }","function cumpleanosClonandoObjeto(persona){\n return {\n ...persona,\n edad: persona.edad += 1\n }\n}","function objSeal(){\n var digits = {\n 1:'one',\n 2:'two',\n 3:'three',\n }\n // Object.defineProperty(digits,2,{\n // writable:false\n // })\n console.log(digits);\n Object.seal(digits);\n digits[2] = 'TWO';\n console.log(digits);\n}","set x(x) {\n this[0] = x;\n }","set(param, value) {\n return this.clone({\n param,\n value,\n op: 's'\n });\n }","function changing(obj){\n obj.greeting = 'hola'; //mutate\n}","set() {}","function ComparedObject(value) {\n this.value = value;\n }","function changeGreeting(obj) {\n obj.greeting = 'Hola'; // mutate \n}","function M(){this.a={}}","function snapshot(value, merged = 1) {\n return { value, merged };\n}","function identity(val){\n return val;\n }","function identity(val){\n return val;\n }","function identity(val){\n return val;\n }","constructor () {\n this.storage = immutable.Map()\n }","static initialize(obj, id, value) { \n obj['id'] = id;\n obj['value'] = value;\n }","copy() {\n return new this.constructor(\n this.power,\n this.value,\n (this.next != null) ? this.next.copy() : null,\n );\n }","function identity(value) {\n return value;\n }","function identity(value) {\n return value;\n }","function identity(value) {\n return value;\n }","function identity(value) {\n return value;\n }","function identity(value) {\n return value;\n }","function identity(value) {\n return value;\n }","function identity(value) {\n return value;\n }","function identity(value) {\n return value;\n }","function identity(value) {\n return value;\n }","function shallowReadonly(target) {\r\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\r\n}","function shallowReadonly(target) {\r\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\r\n}","function shallowReadonly(target) {\r\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\r\n}","function M() {\n this.a = {};\n }","function changeGreeting (obj) {\n obj.greeting = 'Hola' // mutate\n}","function changeGreeting(obj) {\n\tobj.greeting = 'Hola'; //mutate\n}","s(_value) {\n this.value = _value;\n this.refresh();\n }","s(_value) {\n this.value = _value;\n this.refresh();\n }","function changeGreeting(obj) {\n obj.greeting = \"hola\" //mutate\n}","function memo (newParameterValue) {\n return initialize.observable({\n observableState,\n newParameterValue\n })\n }","function destructivelyUpdateObjectWithKeyAndValue(object,key,value){\n object[key]=value;\n return object;\n}","function deepCopy(value) {\r\n return deepExtend(undefined, value);\r\n}","function deepCopy(value) {\r\n return deepExtend(undefined, value);\r\n}","set(param, value) {\n return this.clone({ param, value, op: 's' });\n }","set(param, value) {\n return this.clone({ param, value, op: 's' });\n }","set(param, value) {\n return this.clone({ param, value, op: 's' });\n }","set(param, value) {\n return this.clone({ param, value, op: 's' });\n }","set(param, value) {\n return this.clone({ param, value, op: 's' });\n }","function shallowReadonly(target) {\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\n}","function shallowReadonly(target) {\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\n}","function shallowReadonly(target) {\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\n}","function shallowReadonly(target) {\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\n}","function shallowReadonly(target) {\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\n}","function shallowReadonly(target) {\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\n}","function shallowReadonly(target) {\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\n}","constant(name, value) {\n return this.singleton(name, () => value);\n }","function setA(o, val) {\n o.a = val;\n}","constructor() {\n this.value = {};\n this.num = 0;\n }","get value() { return this._value; }","get value() { return this._value; }","get value() { return this._value; }","get value() { return this._value; }","get value() { return this._value; }","get value() { return this._value; }","get value() { return this._value; }","get value() { return this._value; }","get value() { return this._value; }"],"string":"[\n \"function immutableObjectTest(){\\n\\nlet test= {'name': 'vishal', 'age':27};\\n//Object.freeze(test);\\nlet test2= test;\\n\\ntest.age = 26;\\nconsole.log(test);\\nconsole.log(test2);\\nconsole.log(test === test2);\\n\\n\\n\\n\\n}\",\n \"static set one(value) {}\",\n \"function makeImmutableObject(obj) {\\n\\t if (!globalConfig.use_static) {\\n\\t addPropertyTo(obj, \\\"merge\\\", merge);\\n\\t addPropertyTo(obj, \\\"replace\\\", objectReplace);\\n\\t addPropertyTo(obj, \\\"without\\\", without);\\n\\t addPropertyTo(obj, \\\"asMutable\\\", asMutableObject);\\n\\t addPropertyTo(obj, \\\"set\\\", objectSet);\\n\\t addPropertyTo(obj, \\\"setIn\\\", objectSetIn);\\n\\t addPropertyTo(obj, \\\"update\\\", update);\\n\\t addPropertyTo(obj, \\\"updateIn\\\", updateIn);\\n\\t addPropertyTo(obj, \\\"getIn\\\", getIn);\\n\\t }\\n\\t\\n\\t return makeImmutable(obj, mutatingObjectMethods);\\n\\t }\",\n \"function makeImmutableObject(obj) {\\n\\t if (!globalConfig.use_static) {\\n\\t addPropertyTo(obj, \\\"merge\\\", merge);\\n\\t addPropertyTo(obj, \\\"replace\\\", objectReplace);\\n\\t addPropertyTo(obj, \\\"without\\\", without);\\n\\t addPropertyTo(obj, \\\"asMutable\\\", asMutableObject);\\n\\t addPropertyTo(obj, \\\"set\\\", objectSet);\\n\\t addPropertyTo(obj, \\\"setIn\\\", objectSetIn);\\n\\t addPropertyTo(obj, \\\"update\\\", update);\\n\\t addPropertyTo(obj, \\\"updateIn\\\", updateIn);\\n\\t addPropertyTo(obj, \\\"getIn\\\", getIn);\\n\\t }\\n\\n\\t return makeImmutable(obj, mutatingObjectMethods);\\n\\t }\",\n \"function makeImmutableObject(obj) {\\n\\t if (!globalConfig.use_static) {\\n\\t addPropertyTo(obj, \\\"merge\\\", merge);\\n\\t addPropertyTo(obj, \\\"replace\\\", objectReplace);\\n\\t addPropertyTo(obj, \\\"without\\\", without);\\n\\t addPropertyTo(obj, \\\"asMutable\\\", asMutableObject);\\n\\t addPropertyTo(obj, \\\"set\\\", objectSet);\\n\\t addPropertyTo(obj, \\\"setIn\\\", objectSetIn);\\n\\t addPropertyTo(obj, \\\"update\\\", update);\\n\\t addPropertyTo(obj, \\\"updateIn\\\", updateIn);\\n\\t addPropertyTo(obj, \\\"getIn\\\", getIn);\\n\\t }\\n\\n\\t return makeImmutable(obj, mutatingObjectMethods);\\n\\t }\",\n \"function manipulationBareObj( value ) {\\n\\treturn value;\\n}\",\n \"function toImmutable(arg) {\\n\\t\\t return (isImmutable(arg))\\n\\t\\t ? arg\\n\\t\\t : Immutable.fromJS(arg)\\n\\t\\t}\",\n \"function makeImmutableObject(obj) {\\n if (!globalConfig.use_static) {\\n addPropertyTo(obj, \\\"merge\\\", merge);\\n addPropertyTo(obj, \\\"replace\\\", objectReplace);\\n addPropertyTo(obj, \\\"without\\\", without);\\n addPropertyTo(obj, \\\"asMutable\\\", asMutableObject);\\n addPropertyTo(obj, \\\"set\\\", objectSet);\\n addPropertyTo(obj, \\\"setIn\\\", objectSetIn);\\n addPropertyTo(obj, \\\"update\\\", update);\\n addPropertyTo(obj, \\\"updateIn\\\", updateIn);\\n addPropertyTo(obj, \\\"getIn\\\", getIn);\\n }\\n\\n return makeImmutable(obj, mutatingObjectMethods);\\n }\",\n \"function toImmutable(arg) {\\n\\t return (isImmutable(arg))\\n\\t ? arg\\n\\t : Immutable.fromJS(arg)\\n\\t}\",\n \"function castImmutable(value) {\\n return value;\\n}\",\n \"function set(obj, key, val, immutable) {\\n if (immutable)\\n return _set(assign({}, obj), key, val);\\n return _set(obj, key, val);\\n}\",\n \"function constObjects() {\\n const name = {\\n person: \\\"reefath\\\"\\n }\\n \\n name.person = \\\"tesla\\\"\\n \\n return name.person;\\n}\",\n \"function makeImmutableProperty (self, schema, values, propName) {\\n var Model, dateCopy;\\n\\n if (schema[propName].__immutableCtor && is.function(schema[propName])) {\\n // this is a nested immutable\\n Model = schema[propName];\\n self[propName] = new Model(values[propName]);\\n } else if (isDate(values[propName])) {\\n dateCopy = new Date(values[propName]);\\n\\n Object.defineProperty(self, propName, {\\n get: function () {\\n return new Date(dateCopy);\\n },\\n enumerable: true,\\n configurable: false\\n });\\n\\n Object.freeze(self[propName]);\\n } else {\\n objectHelper.setReadOnlyProperty(\\n self,\\n propName,\\n // TODO: is it really necessary to clone the value if it isn't an object?\\n objectHelper.copyValue(values[propName]),\\n // typeof values[propName] === 'object' ? objectHelper.copyValue(values[propName]) : values[propName],\\n makeSetHandler(propName)\\n );\\n\\n if (Array.isArray(values[propName])) {\\n Object.freeze(self[propName]);\\n }\\n }\\n }\",\n \"set(name, value) {\\n return this.clone({\\n name,\\n value,\\n op: 's'\\n });\\n }\",\n \"set Baked(value) {}\",\n \"set x(value = 42) {}\",\n \"set x(value) {}\",\n \"copyable(newValue = true) {\\n this.value.copyable = newValue;\\n return this;\\n }\",\n \"function put(obj, key, val, immutable) {\\n if (immutable)\\n return _put(assign({}, obj), key, val);\\n return _put(obj, key, val);\\n}\",\n \"set(name, value) {\\n return this.clone({ name, value, op: 's' });\\n }\",\n \"set(name, value) {\\n return this.clone({ name, value, op: 's' });\\n }\",\n \"set(name, value) {\\n return this.clone({ name, value, op: 's' });\\n }\",\n \"set(name, value) {\\n return this.clone({ name, value, op: 's' });\\n }\",\n \"set(name, value) {\\n return this.clone({ name, value, op: 's' });\\n }\",\n \"set(index, object) {\\n return object;\\n }\",\n \"set value(value) {}\",\n \"build() {\\n const state = Immutable.from(this.state);\\n this.setState(state);\\n return state.asMutable();\\n }\",\n \"set(obj, value) {\\n return this.update(obj, () => value);\\n }\",\n \"static foo (a) { return { ...a, b: 2 } }\",\n \"function constantobjects() {\\n const user = {\\n name: \\\"John\\\"\\n };\\n\\n console.log(user.name);\\n\\n // does it work? // yes\\n user.name = \\\"Pete\\\";\\n console.log(user.name);\\n}\",\n \"set(value) {\\n if (value === this._value) {\\n return this;\\n }\\n\\n return new ImmutableAccessor(value, this.path);\\n }\",\n \"function example6() {\\n var o = { a: 1 };\\n o.a = 2; //allowed: change ref object\\n o.b = 1; //allowed: change ref object\\n\\n // o = {a: 1} //not allowed: change referece itself\\n}\",\n \"static set zero(value) {}\",\n \"copy() {\\n return Object.assign(Object.create(this), JSON.parse(JSON.stringify(this)))\\n }\",\n \"set(v) { /* empty */ }\",\n \"set(value) {\\n this.value = value\\n if (this.autoUpdate) {\\n this.update()\\n }\\n return this // chain me up baby\\n }\",\n \"copy({ type = this.type, value = this.value } = {}) {\\n const { id, lbp, rules, unknown, ignored } = this;\\n return new this.constructor(id, {\\n lbp,\\n rules,\\n unknown,\\n ignored,\\n type,\\n value,\\n original: this,\\n });\\n }\",\n \"function identity(val){\\n\\t return val;\\n\\t }\",\n \"one() {\\r\\n this.data.fill(0);\\r\\n this.data[0] = 1;\\r\\n }\",\n \"function cumpleanosClonandoObjeto(persona){\\n return {\\n ...persona,\\n edad: persona.edad += 1\\n }\\n}\",\n \"function objSeal(){\\n var digits = {\\n 1:'one',\\n 2:'two',\\n 3:'three',\\n }\\n // Object.defineProperty(digits,2,{\\n // writable:false\\n // })\\n console.log(digits);\\n Object.seal(digits);\\n digits[2] = 'TWO';\\n console.log(digits);\\n}\",\n \"set x(x) {\\n this[0] = x;\\n }\",\n \"set(param, value) {\\n return this.clone({\\n param,\\n value,\\n op: 's'\\n });\\n }\",\n \"function changing(obj){\\n obj.greeting = 'hola'; //mutate\\n}\",\n \"set() {}\",\n \"function ComparedObject(value) {\\n this.value = value;\\n }\",\n \"function changeGreeting(obj) {\\n obj.greeting = 'Hola'; // mutate \\n}\",\n \"function M(){this.a={}}\",\n \"function snapshot(value, merged = 1) {\\n return { value, merged };\\n}\",\n \"function identity(val){\\n return val;\\n }\",\n \"function identity(val){\\n return val;\\n }\",\n \"function identity(val){\\n return val;\\n }\",\n \"constructor () {\\n this.storage = immutable.Map()\\n }\",\n \"static initialize(obj, id, value) { \\n obj['id'] = id;\\n obj['value'] = value;\\n }\",\n \"copy() {\\n return new this.constructor(\\n this.power,\\n this.value,\\n (this.next != null) ? this.next.copy() : null,\\n );\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function identity(value) {\\n return value;\\n }\",\n \"function shallowReadonly(target) {\\r\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\r\\n}\",\n \"function shallowReadonly(target) {\\r\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\r\\n}\",\n \"function shallowReadonly(target) {\\r\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\r\\n}\",\n \"function M() {\\n this.a = {};\\n }\",\n \"function changeGreeting (obj) {\\n obj.greeting = 'Hola' // mutate\\n}\",\n \"function changeGreeting(obj) {\\n\\tobj.greeting = 'Hola'; //mutate\\n}\",\n \"s(_value) {\\n this.value = _value;\\n this.refresh();\\n }\",\n \"s(_value) {\\n this.value = _value;\\n this.refresh();\\n }\",\n \"function changeGreeting(obj) {\\n obj.greeting = \\\"hola\\\" //mutate\\n}\",\n \"function memo (newParameterValue) {\\n return initialize.observable({\\n observableState,\\n newParameterValue\\n })\\n }\",\n \"function destructivelyUpdateObjectWithKeyAndValue(object,key,value){\\n object[key]=value;\\n return object;\\n}\",\n \"function deepCopy(value) {\\r\\n return deepExtend(undefined, value);\\r\\n}\",\n \"function deepCopy(value) {\\r\\n return deepExtend(undefined, value);\\r\\n}\",\n \"set(param, value) {\\n return this.clone({ param, value, op: 's' });\\n }\",\n \"set(param, value) {\\n return this.clone({ param, value, op: 's' });\\n }\",\n \"set(param, value) {\\n return this.clone({ param, value, op: 's' });\\n }\",\n \"set(param, value) {\\n return this.clone({ param, value, op: 's' });\\n }\",\n \"set(param, value) {\\n return this.clone({ param, value, op: 's' });\\n }\",\n \"function shallowReadonly(target) {\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\n}\",\n \"function shallowReadonly(target) {\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\n}\",\n \"function shallowReadonly(target) {\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\n}\",\n \"function shallowReadonly(target) {\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\n}\",\n \"function shallowReadonly(target) {\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\n}\",\n \"function shallowReadonly(target) {\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\n}\",\n \"function shallowReadonly(target) {\\n return createReactiveObject(target, true, shallowReadonlyHandlers, shallowReadonlyCollectionHandlers, shallowReadonlyMap);\\n}\",\n \"constant(name, value) {\\n return this.singleton(name, () => value);\\n }\",\n \"function setA(o, val) {\\n o.a = val;\\n}\",\n \"constructor() {\\n this.value = {};\\n this.num = 0;\\n }\",\n \"get value() { return this._value; }\",\n \"get value() { return this._value; }\",\n \"get value() { return this._value; }\",\n \"get value() { return this._value; }\",\n \"get value() { return this._value; }\",\n \"get value() { return this._value; }\",\n \"get value() { return this._value; }\",\n \"get value() { return this._value; }\",\n \"get value() { return this._value; }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6674448","0.66609514","0.6358345","0.6347869","0.6347869","0.6263268","0.6230736","0.6136926","0.61048114","0.5915378","0.5889688","0.580687","0.5776291","0.5763881","0.57248324","0.56947106","0.566211","0.5636481","0.56181127","0.5606209","0.5606209","0.5606209","0.5606209","0.5606209","0.5586234","0.557178","0.55356383","0.55104053","0.55075973","0.550587","0.54879093","0.54802936","0.5433998","0.5431201","0.54187083","0.5394902","0.53887403","0.53795755","0.5371964","0.5357756","0.53558546","0.5347443","0.5346903","0.53416175","0.53413206","0.533415","0.53338236","0.53209484","0.5320444","0.5318093","0.5318093","0.5318093","0.5310658","0.53033954","0.5293375","0.52826554","0.52826554","0.52826554","0.52826554","0.52826554","0.52826554","0.52826554","0.52826554","0.52826554","0.52801293","0.52801293","0.52801293","0.5260411","0.5250951","0.52408385","0.5236158","0.5236158","0.523219","0.5231279","0.5225852","0.5224158","0.5224158","0.5219042","0.5219042","0.5219042","0.5219042","0.5219042","0.5208099","0.5208099","0.5208099","0.5208099","0.5208099","0.5208099","0.5208099","0.52074826","0.52008766","0.51992226","0.519395","0.519395","0.519395","0.519395","0.519395","0.519395","0.519395","0.519395","0.519395"],"string":"[\n \"0.6674448\",\n \"0.66609514\",\n \"0.6358345\",\n \"0.6347869\",\n \"0.6347869\",\n \"0.6263268\",\n \"0.6230736\",\n \"0.6136926\",\n \"0.61048114\",\n \"0.5915378\",\n \"0.5889688\",\n \"0.580687\",\n \"0.5776291\",\n \"0.5763881\",\n \"0.57248324\",\n \"0.56947106\",\n \"0.566211\",\n \"0.5636481\",\n \"0.56181127\",\n \"0.5606209\",\n \"0.5606209\",\n \"0.5606209\",\n \"0.5606209\",\n \"0.5606209\",\n \"0.5586234\",\n \"0.557178\",\n \"0.55356383\",\n \"0.55104053\",\n \"0.55075973\",\n \"0.550587\",\n \"0.54879093\",\n \"0.54802936\",\n \"0.5433998\",\n \"0.5431201\",\n \"0.54187083\",\n \"0.5394902\",\n \"0.53887403\",\n \"0.53795755\",\n \"0.5371964\",\n \"0.5357756\",\n \"0.53558546\",\n \"0.5347443\",\n \"0.5346903\",\n \"0.53416175\",\n \"0.53413206\",\n \"0.533415\",\n \"0.53338236\",\n \"0.53209484\",\n \"0.5320444\",\n \"0.5318093\",\n \"0.5318093\",\n \"0.5318093\",\n \"0.5310658\",\n \"0.53033954\",\n \"0.5293375\",\n \"0.52826554\",\n \"0.52826554\",\n \"0.52826554\",\n \"0.52826554\",\n \"0.52826554\",\n \"0.52826554\",\n \"0.52826554\",\n \"0.52826554\",\n \"0.52826554\",\n \"0.52801293\",\n \"0.52801293\",\n \"0.52801293\",\n \"0.5260411\",\n \"0.5250951\",\n \"0.52408385\",\n \"0.5236158\",\n \"0.5236158\",\n \"0.523219\",\n \"0.5231279\",\n \"0.5225852\",\n \"0.5224158\",\n \"0.5224158\",\n \"0.5219042\",\n \"0.5219042\",\n \"0.5219042\",\n \"0.5219042\",\n \"0.5219042\",\n \"0.5208099\",\n \"0.5208099\",\n \"0.5208099\",\n \"0.5208099\",\n \"0.5208099\",\n \"0.5208099\",\n \"0.5208099\",\n \"0.52074826\",\n \"0.52008766\",\n \"0.51992226\",\n \"0.519395\",\n \"0.519395\",\n \"0.519395\",\n \"0.519395\",\n \"0.519395\",\n \"0.519395\",\n \"0.519395\",\n \"0.519395\",\n \"0.519395\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":5799,"cells":{"query":{"kind":"string","value":"Create and return a new ReactElement of the given type. See"},"document":{"kind":"string","value":"function createElement(type, config, children) {\n var propName = void 0;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["function createElement(type,config,children){var propName;// Reserved names are extracted\nvar props={};var key=null;var ref=null;var self=null;var source=null;if(config!=null){if(hasValidRef(config)){ref=config.ref;{warnIfStringRefCannotBeAutoConverted(config);}}if(hasValidKey(config)){key=''+config.key;}self=config.__self===undefined?null:config.__self;source=config.__source===undefined?null:config.__source;// Remaining properties are added to a new props object\nfor(propName in config){if(hasOwnProperty.call(config,propName)&&!RESERVED_PROPS.hasOwnProperty(propName)){props[propName]=config[propName];}}}// Children can be more than one argument, and those are transferred onto\n// the newly allocated props object.\nvar childrenLength=arguments.length-2;if(childrenLength===1){props.children=children;}else if(childrenLength>1){var childArray=Array(childrenLength);for(var i=0;i<childrenLength;i++){childArray[i]=arguments[i+2];}{if(Object.freeze){Object.freeze(childArray);}}props.children=childArray;}// Resolve default props\nif(type&&type.defaultProps){var defaultProps=type.defaultProps;for(propName in defaultProps){if(props[propName]===undefined){props[propName]=defaultProps[propName];}}}{if(key||ref){var displayName=typeof type==='function'?type.displayName||type.name||'Unknown':type;if(key){defineKeyPropWarningGetter(props,displayName);}if(ref){defineRefPropWarningGetter(props,displayName);}}}return ReactElement(type,key,ref,self,source,ReactCurrentOwner.current,props);}","function createElement(type,config,children){var propName=void 0;// Reserved names are extracted\nvar props={};var key=null;var ref=null;var self=null;var source=null;if(config!=null){if(hasValidRef(config)){ref=config.ref;}if(hasValidKey(config)){key=''+config.key;}self=config.__self===undefined?null:config.__self;source=config.__source===undefined?null:config.__source;// Remaining properties are added to a new props object\nfor(propName in config){if(hasOwnProperty.call(config,propName)&&!RESERVED_PROPS.hasOwnProperty(propName)){props[propName]=config[propName];}}}// Children can be more than one argument, and those are transferred onto\n// the newly allocated props object.\nvar childrenLength=arguments.length-2;if(childrenLength===1){props.children=children;}else if(childrenLength>1){var childArray=Array(childrenLength);for(var i=0;i<childrenLength;i++){childArray[i]=arguments[i+2];}{if(Object.freeze){Object.freeze(childArray);}}props.children=childArray;}// Resolve default props\nif(type&&type.defaultProps){var defaultProps=type.defaultProps;for(propName in defaultProps){if(props[propName]===undefined){props[propName]=defaultProps[propName];}}}{if(key||ref){var displayName=typeof type==='function'?type.displayName||type.name||'Unknown':type;if(key){defineKeyPropWarningGetter(props,displayName);}if(ref){defineRefPropWarningGetter(props,displayName);}}}return ReactElement(type,key,ref,self,source,ReactCurrentOwner.current,props);}","function createElement(type) {\n return document.createElement(type);\n }","function makeElement(type) {\n\t\treturn document.createElement(type);\n\t}","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createDOMFactory(type) {\n var factory = React.createElement.bind(null, type);\n // Expose the type on the factory and the prototype so that it can be\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\n // This should not be named `constructor` since this may not be the function\n // that created the element, and it may not even be a constructor.\n factory.type = type;\n return factory;\n }","function createElement (type, props, ...children) {\n if (props.class) {\n processClasses(props.class)\n }\n return createDOMElement(type, props, ...children)\n}","function make(type) {\n\treturn document.createElement(type);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createReactElement(component) {\n\treturn {\n\t\ttype: component.constructor,\n\t\tkey: component.key,\n\t\tref: null, // Unsupported\n\t\tprops: component.props\n\t};\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName;\n\n // Reserved names are extracted\n var props = {};\n\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n }\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source;\n // Remaining properties are added to a new props object\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n }\n\n // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n props.children = childArray;\n }\n\n // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n {\n if (key || ref) {\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n var props = {\n };\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n warnIfStringRefCannotBeAutoConverted(config);\n }\n if (hasValidKey(config)) key = '' + config.key;\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n for(propName in config)if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) props[propName] = config[propName];\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n var childrenLength = arguments.length - 2;\n if (childrenLength === 1) props.children = children;\n else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n for(var i = 0; i < childrenLength; i++)childArray[i] = arguments[i + 2];\n if (Object.freeze) Object.freeze(childArray);\n props.children = childArray;\n } // Resolve default props\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n for(propName in defaultProps)if (props[propName] === undefined) props[propName] = defaultProps[propName];\n }\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n if (key) defineKeyPropWarningGetter(props, displayName);\n if (ref) defineRefPropWarningGetter(props, displayName);\n }\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n }","function element(type, props, ...children) {\n let e = document.createElement(type);\n if (typeof props != \"undefined\" && props != null) {\n Object.keys(props).forEach(key => e.setAttribute(key, props[key]));\n }\n if (typeof children != \"undefined\" && children != null) {\n children.forEach(child => e.appendChild(child));\n }\n return e;\n}","getElementConstructor(type) {\n return JSXElement;\n }","function createElement(type, config, children) {\n\t var propName;\n\t\n\t // Reserved names are extracted\n\t var props = {};\n\t\n\t var key = null;\n\t var ref = null;\n\t var self = null;\n\t var source = null;\n\t\n\t if (config != null) {\n\t if (hasValidRef(config)) {\n\t ref = config.ref;\n\t }\n\t if (hasValidKey(config)) {\n\t key = '' + config.key;\n\t }\n\t\n\t self = config.__self === undefined ? null : config.__self;\n\t source = config.__source === undefined ? null : config.__source;\n\t // Remaining properties are added to a new props object\n\t for (propName in config) {\n\t if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n\t props[propName] = config[propName];\n\t }\n\t }\n\t }\n\t\n\t // Children can be more than one argument, and those are transferred onto\n\t // the newly allocated props object.\n\t var childrenLength = arguments.length - 2;\n\t if (childrenLength === 1) {\n\t props.children = children;\n\t } else if (childrenLength > 1) {\n\t var childArray = Array(childrenLength);\n\t for (var i = 0; i < childrenLength; i++) {\n\t childArray[i] = arguments[i + 2];\n\t }\n\t {\n\t if (Object.freeze) {\n\t Object.freeze(childArray);\n\t }\n\t }\n\t props.children = childArray;\n\t }\n\t\n\t // Resolve default props\n\t if (type && type.defaultProps) {\n\t var defaultProps = type.defaultProps;\n\t for (propName in defaultProps) {\n\t if (props[propName] === undefined) {\n\t props[propName] = defaultProps[propName];\n\t }\n\t }\n\t }\n\t {\n\t if (key || ref) {\n\t if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\n\t var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\t if (key) {\n\t defineKeyPropWarningGetter(props, displayName);\n\t }\n\t if (ref) {\n\t defineRefPropWarningGetter(props, displayName);\n\t }\n\t }\n\t }\n\t }\n\t return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n\t}","function el(type, ...value) {\n const newElement = document.createElement(type);\n if (typeof value[0] === 'string') {\n newElement.textContent = value[0];\n } else {\n value.forEach(e => newElement.appendChild(e));\n }\n return newElement;\n }","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}","function createElement(type, config, children) {\n var propName; // Reserved names are extracted\n\n var props = {};\n var key = null;\n var ref = null;\n var self = null;\n var source = null;\n\n if (config != null) {\n if (hasValidRef(config)) {\n ref = config.ref;\n\n {\n warnIfStringRefCannotBeAutoConverted(config);\n }\n }\n\n if (hasValidKey(config)) {\n key = '' + config.key;\n }\n\n self = config.__self === undefined ? null : config.__self;\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\n\n for (propName in config) {\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\n props[propName] = config[propName];\n }\n }\n } // Children can be more than one argument, and those are transferred onto\n // the newly allocated props object.\n\n\n var childrenLength = arguments.length - 2;\n\n if (childrenLength === 1) {\n props.children = children;\n } else if (childrenLength > 1) {\n var childArray = Array(childrenLength);\n\n for (var i = 0; i < childrenLength; i++) {\n childArray[i] = arguments[i + 2];\n }\n\n {\n if (Object.freeze) {\n Object.freeze(childArray);\n }\n }\n\n props.children = childArray;\n } // Resolve default props\n\n\n if (type && type.defaultProps) {\n var defaultProps = type.defaultProps;\n\n for (propName in defaultProps) {\n if (props[propName] === undefined) {\n props[propName] = defaultProps[propName];\n }\n }\n }\n\n {\n if (key || ref) {\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\n\n if (key) {\n defineKeyPropWarningGetter(props, displayName);\n }\n\n if (ref) {\n defineRefPropWarningGetter(props, displayName);\n }\n }\n }\n\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\n}"],"string":"[\n \"function createElement(type,config,children){var propName;// Reserved names are extracted\\nvar props={};var key=null;var ref=null;var self=null;var source=null;if(config!=null){if(hasValidRef(config)){ref=config.ref;{warnIfStringRefCannotBeAutoConverted(config);}}if(hasValidKey(config)){key=''+config.key;}self=config.__self===undefined?null:config.__self;source=config.__source===undefined?null:config.__source;// Remaining properties are added to a new props object\\nfor(propName in config){if(hasOwnProperty.call(config,propName)&&!RESERVED_PROPS.hasOwnProperty(propName)){props[propName]=config[propName];}}}// Children can be more than one argument, and those are transferred onto\\n// the newly allocated props object.\\nvar childrenLength=arguments.length-2;if(childrenLength===1){props.children=children;}else if(childrenLength>1){var childArray=Array(childrenLength);for(var i=0;i<childrenLength;i++){childArray[i]=arguments[i+2];}{if(Object.freeze){Object.freeze(childArray);}}props.children=childArray;}// Resolve default props\\nif(type&&type.defaultProps){var defaultProps=type.defaultProps;for(propName in defaultProps){if(props[propName]===undefined){props[propName]=defaultProps[propName];}}}{if(key||ref){var displayName=typeof type==='function'?type.displayName||type.name||'Unknown':type;if(key){defineKeyPropWarningGetter(props,displayName);}if(ref){defineRefPropWarningGetter(props,displayName);}}}return ReactElement(type,key,ref,self,source,ReactCurrentOwner.current,props);}\",\n \"function createElement(type,config,children){var propName=void 0;// Reserved names are extracted\\nvar props={};var key=null;var ref=null;var self=null;var source=null;if(config!=null){if(hasValidRef(config)){ref=config.ref;}if(hasValidKey(config)){key=''+config.key;}self=config.__self===undefined?null:config.__self;source=config.__source===undefined?null:config.__source;// Remaining properties are added to a new props object\\nfor(propName in config){if(hasOwnProperty.call(config,propName)&&!RESERVED_PROPS.hasOwnProperty(propName)){props[propName]=config[propName];}}}// Children can be more than one argument, and those are transferred onto\\n// the newly allocated props object.\\nvar childrenLength=arguments.length-2;if(childrenLength===1){props.children=children;}else if(childrenLength>1){var childArray=Array(childrenLength);for(var i=0;i<childrenLength;i++){childArray[i]=arguments[i+2];}{if(Object.freeze){Object.freeze(childArray);}}props.children=childArray;}// Resolve default props\\nif(type&&type.defaultProps){var defaultProps=type.defaultProps;for(propName in defaultProps){if(props[propName]===undefined){props[propName]=defaultProps[propName];}}}{if(key||ref){var displayName=typeof type==='function'?type.displayName||type.name||'Unknown':type;if(key){defineKeyPropWarningGetter(props,displayName);}if(ref){defineRefPropWarningGetter(props,displayName);}}}return ReactElement(type,key,ref,self,source,ReactCurrentOwner.current,props);}\",\n \"function createElement(type) {\\n return document.createElement(type);\\n }\",\n \"function makeElement(type) {\\n\\t\\treturn document.createElement(type);\\n\\t}\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createDOMFactory(type) {\\n var factory = React.createElement.bind(null, type);\\n // Expose the type on the factory and the prototype so that it can be\\n // easily accessed on elements. E.g. `<Foo />.type === Foo`.\\n // This should not be named `constructor` since this may not be the function\\n // that created the element, and it may not even be a constructor.\\n factory.type = type;\\n return factory;\\n }\",\n \"function createElement (type, props, ...children) {\\n if (props.class) {\\n processClasses(props.class)\\n }\\n return createDOMElement(type, props, ...children)\\n}\",\n \"function make(type) {\\n\\treturn document.createElement(type);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE$1) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createReactElement(component) {\\n\\treturn {\\n\\t\\ttype: component.constructor,\\n\\t\\tkey: component.key,\\n\\t\\tref: null, // Unsupported\\n\\t\\tprops: component.props\\n\\t};\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName;\\n\\n // Reserved names are extracted\\n var props = {};\\n\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n }\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source;\\n // Remaining properties are added to a new props object\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n }\\n\\n // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n props.children = childArray;\\n }\\n\\n // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n {\\n if (key || ref) {\\n if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n var props = {\\n };\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n if (hasValidKey(config)) key = '' + config.key;\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n for(propName in config)if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) props[propName] = config[propName];\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n var childrenLength = arguments.length - 2;\\n if (childrenLength === 1) props.children = children;\\n else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n for(var i = 0; i < childrenLength; i++)childArray[i] = arguments[i + 2];\\n if (Object.freeze) Object.freeze(childArray);\\n props.children = childArray;\\n } // Resolve default props\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n for(propName in defaultProps)if (props[propName] === undefined) props[propName] = defaultProps[propName];\\n }\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n if (key) defineKeyPropWarningGetter(props, displayName);\\n if (ref) defineRefPropWarningGetter(props, displayName);\\n }\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n }\",\n \"function element(type, props, ...children) {\\n let e = document.createElement(type);\\n if (typeof props != \\\"undefined\\\" && props != null) {\\n Object.keys(props).forEach(key => e.setAttribute(key, props[key]));\\n }\\n if (typeof children != \\\"undefined\\\" && children != null) {\\n children.forEach(child => e.appendChild(child));\\n }\\n return e;\\n}\",\n \"getElementConstructor(type) {\\n return JSXElement;\\n }\",\n \"function createElement(type, config, children) {\\n\\t var propName;\\n\\t\\n\\t // Reserved names are extracted\\n\\t var props = {};\\n\\t\\n\\t var key = null;\\n\\t var ref = null;\\n\\t var self = null;\\n\\t var source = null;\\n\\t\\n\\t if (config != null) {\\n\\t if (hasValidRef(config)) {\\n\\t ref = config.ref;\\n\\t }\\n\\t if (hasValidKey(config)) {\\n\\t key = '' + config.key;\\n\\t }\\n\\t\\n\\t self = config.__self === undefined ? null : config.__self;\\n\\t source = config.__source === undefined ? null : config.__source;\\n\\t // Remaining properties are added to a new props object\\n\\t for (propName in config) {\\n\\t if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n\\t props[propName] = config[propName];\\n\\t }\\n\\t }\\n\\t }\\n\\t\\n\\t // Children can be more than one argument, and those are transferred onto\\n\\t // the newly allocated props object.\\n\\t var childrenLength = arguments.length - 2;\\n\\t if (childrenLength === 1) {\\n\\t props.children = children;\\n\\t } else if (childrenLength > 1) {\\n\\t var childArray = Array(childrenLength);\\n\\t for (var i = 0; i < childrenLength; i++) {\\n\\t childArray[i] = arguments[i + 2];\\n\\t }\\n\\t {\\n\\t if (Object.freeze) {\\n\\t Object.freeze(childArray);\\n\\t }\\n\\t }\\n\\t props.children = childArray;\\n\\t }\\n\\t\\n\\t // Resolve default props\\n\\t if (type && type.defaultProps) {\\n\\t var defaultProps = type.defaultProps;\\n\\t for (propName in defaultProps) {\\n\\t if (props[propName] === undefined) {\\n\\t props[propName] = defaultProps[propName];\\n\\t }\\n\\t }\\n\\t }\\n\\t {\\n\\t if (key || ref) {\\n\\t if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {\\n\\t var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\t if (key) {\\n\\t defineKeyPropWarningGetter(props, displayName);\\n\\t }\\n\\t if (ref) {\\n\\t defineRefPropWarningGetter(props, displayName);\\n\\t }\\n\\t }\\n\\t }\\n\\t }\\n\\t return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n\\t}\",\n \"function el(type, ...value) {\\n const newElement = document.createElement(type);\\n if (typeof value[0] === 'string') {\\n newElement.textContent = value[0];\\n } else {\\n value.forEach(e => newElement.appendChild(e));\\n }\\n return newElement;\\n }\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\",\n \"function createElement(type, config, children) {\\n var propName; // Reserved names are extracted\\n\\n var props = {};\\n var key = null;\\n var ref = null;\\n var self = null;\\n var source = null;\\n\\n if (config != null) {\\n if (hasValidRef(config)) {\\n ref = config.ref;\\n\\n {\\n warnIfStringRefCannotBeAutoConverted(config);\\n }\\n }\\n\\n if (hasValidKey(config)) {\\n key = '' + config.key;\\n }\\n\\n self = config.__self === undefined ? null : config.__self;\\n source = config.__source === undefined ? null : config.__source; // Remaining properties are added to a new props object\\n\\n for (propName in config) {\\n if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {\\n props[propName] = config[propName];\\n }\\n }\\n } // Children can be more than one argument, and those are transferred onto\\n // the newly allocated props object.\\n\\n\\n var childrenLength = arguments.length - 2;\\n\\n if (childrenLength === 1) {\\n props.children = children;\\n } else if (childrenLength > 1) {\\n var childArray = Array(childrenLength);\\n\\n for (var i = 0; i < childrenLength; i++) {\\n childArray[i] = arguments[i + 2];\\n }\\n\\n {\\n if (Object.freeze) {\\n Object.freeze(childArray);\\n }\\n }\\n\\n props.children = childArray;\\n } // Resolve default props\\n\\n\\n if (type && type.defaultProps) {\\n var defaultProps = type.defaultProps;\\n\\n for (propName in defaultProps) {\\n if (props[propName] === undefined) {\\n props[propName] = defaultProps[propName];\\n }\\n }\\n }\\n\\n {\\n if (key || ref) {\\n var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;\\n\\n if (key) {\\n defineKeyPropWarningGetter(props, displayName);\\n }\\n\\n if (ref) {\\n defineRefPropWarningGetter(props, displayName);\\n }\\n }\\n }\\n\\n return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.68920434","0.6835192","0.6767826","0.6757532","0.6745889","0.6745889","0.6745889","0.6745889","0.6745889","0.6745889","0.6745889","0.6745889","0.6745889","0.65640503","0.65581757","0.6406998","0.6406998","0.6406998","0.6406998","0.6406998","0.63805515","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.637205","0.6369105","0.6335276","0.6318601","0.62708944","0.6232016","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123","0.6230123"],"string":"[\n \"0.68920434\",\n \"0.6835192\",\n \"0.6767826\",\n \"0.6757532\",\n \"0.6745889\",\n \"0.6745889\",\n \"0.6745889\",\n \"0.6745889\",\n \"0.6745889\",\n \"0.6745889\",\n \"0.6745889\",\n \"0.6745889\",\n \"0.6745889\",\n \"0.65640503\",\n \"0.65581757\",\n \"0.6406998\",\n \"0.6406998\",\n \"0.6406998\",\n \"0.6406998\",\n \"0.6406998\",\n \"0.63805515\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.637205\",\n \"0.6369105\",\n \"0.6335276\",\n \"0.6318601\",\n \"0.62708944\",\n \"0.6232016\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\",\n \"0.6230123\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6344786"},"document_rank":{"kind":"string","value":"65"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":57,"numItemsPerPage":100,"numTotalItems":82052,"offset":5700,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3Mzk1MDIzNCwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhc2NyaXB0LXYxIiwiZXhwIjoxNzczOTUzODM0LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.da_slDMXXtO6kFU0QOQNxvuZzgFZgYHn4fxmYTMm0ZjdR28v5D7O5jJrGCSLmDOPUj_hHwCv-nBT5fLnGa17Bw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":82052,"numBytesParquet":1713312505}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
Search is not available for this dataset
query stringlengths 7 355k | document stringlengths 9 341k | metadata dict | negatives listlengths 0 101 | negative_scores listlengths 0 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
deinterpolate(a, b)(x) takes a domain value x in [a,b] and returns the corresponding parameter t in [0,1]. reinterpolate(a, b)(t) takes a parameter t in [0,1] and returns the corresponding domain value x in [a,b]. | function continuous(deinterpolate, reinterpolate) {
var domain = unit,
range$$1 = unit,
interpolate$$1 = d3Interpolate.interpolate,
clamp = false,
piecewise,
output,
input;
function rescale() {
piecewise = Math.min(domain.length, range$$1.length) > 2 ? polymap : bimap;
output = input = null;
return scale;
}
function scale(x) {
return (output || (output = piecewise(domain, range$$1, clamp ? deinterpolateClamp(deinterpolate) : deinterpolate, interpolate$$1)))(+x);
}
scale.invert = function(y) {
return (input || (input = piecewise(range$$1, domain, deinterpolateLinear, clamp ? reinterpolateClamp(reinterpolate) : reinterpolate)))(+y);
};
scale.domain = function(_) {
return arguments.length ? (domain = map$1.call(_, number), rescale()) : domain.slice();
};
scale.range = function(_) {
return arguments.length ? (range$$1 = slice.call(_), rescale()) : range$$1.slice();
};
scale.rangeRound = function(_) {
return range$$1 = slice.call(_), interpolate$$1 = d3Interpolate.interpolateRound, rescale();
};
scale.clamp = function(_) {
return arguments.length ? (clamp = !!_, rescale()) : clamp;
};
scale.interpolate = function(_) {
return arguments.length ? (interpolate$$1 = _, rescale()) : interpolate$$1;
};
return rescale();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _interpolate(a, b, t) {\n\t return ((1 - t) * a) + (t * b);\n\t }",
"function _interpolate(a, b, t) {\n return ((1 - t) * a) + (t * b);\n }",
"function _interpolate(a, b, t) {\n return ((1 - t) * a) + (t * b);\n }",
"function continuous(deinterpolate,reinterpolate){var ... | [
"0.67073786",
"0.6663296",
"0.6663296",
"0.6368387",
"0.63470465",
"0.6337132",
"0.6261001",
"0.6240214",
"0.6240214",
"0.62272835",
"0.62272835",
"0.62272835",
"0.62272835",
"0.6221141",
"0.6221141",
"0.6221141",
"0.621756",
"0.6209406",
"0.6209406",
"0.6209406",
"0.6209406"... | 0.63088304 | 12 |
Compute perpendicular offset line of length rc. | function cornerTangents(x0, y0, x1, y1, r1, rc, cw) {
var x01 = x0 - x1,
y01 = y0 - y1,
lo = (cw ? rc : -rc) / sqrt(x01 * x01 + y01 * y01),
ox = lo * y01,
oy = -lo * x01,
x11 = x0 + ox,
y11 = y0 + oy,
x10 = x1 + ox,
y10 = y1 + oy,
x00 = (x11 + x10) / 2,
y00 = (y11 + y10) / 2,
dx = x10 - x11,
dy = y10 - y11,
d2 = dx * dx + dy * dy,
r = r1 - rc,
D = x11 * y10 - x10 * y11,
d = (dy < 0 ? -1 : 1) * sqrt(max(0, r * r * d2 - D * D)),
cx0 = (D * dy - dx * d) / d2,
cy0 = (-D * dx - dy * d) / d2,
cx1 = (D * dy + dx * d) / d2,
cy1 = (-D * dx + dy * d) / d2,
dx0 = cx0 - x00,
dy0 = cy0 - y00,
dx1 = cx1 - x00,
dy1 = cy1 - y00;
// Pick the closer of the two intersection points.
// TODO Is there a faster way to determine which intersection to use?
if (dx0 * dx0 + dy0 * dy0 > dx1 * dx1 + dy1 * dy1) cx0 = cx1, cy0 = cy1;
return {
cx: cx0,
cy: cy0,
x01: -ox,
y01: -oy,
x11: cx0 * (r1 / r - 1),
y11: cy0 * (r1 / r - 1)
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function drawPerpendicularLine(context, eventData, element, data, color, lineWidth) {\n\n // mid point of long-axis line\n var mid = {\n x: (data.handles.start.x + data.handles.end.x) / 2,\n y: (data.handles.start.y + data.handles.end.y) / 2\n };\n\n // Length of l... | [
"0.61555076",
"0.6136213",
"0.592017",
"0.5753711",
"0.5637825",
"0.5612782",
"0.54631627",
"0.5454807",
"0.5444906",
"0.53873765",
"0.5300839",
"0.5262509",
"0.51919144",
"0.5177952",
"0.5157787",
"0.5157787",
"0.5157787",
"0.5149515",
"0.51270515",
"0.5126161",
"0.5105256",... | 0.0 | -1 |
Calculate the slopes of the tangents (Hermitetype interpolation) based on the following paper: Steffen, M. 1990. A Simple Method for Monotonic Interpolation in One Dimension. Astronomy and Astrophysics, Vol. 239, NO. NOV(II), P. 443, 1990. | function slope3(that, x2, y2) {
var h0 = that._x1 - that._x0,
h1 = x2 - that._x1,
s0 = (that._y1 - that._y0) / (h0 || h1 < 0 && -0),
s1 = (y2 - that._y1) / (h1 || h0 < 0 && -0),
p = (s0 * h1 + s1 * h0) / (h0 + h1);
return (sign(s0) + sign(s1)) * Math.min(Math.abs(s0), Math.abs(s1), 0.5 * Math.abs(p)) || 0;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function d3_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function d3_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function d3_svg_lineSlope(p0, p1) {\n return (p1[1] - p0[1]) / (p1[0] - p0[0]);\n}",
"function slope2(that,t){var h=that._x1-that._x0;... | [
"0.6539162",
"0.6539162",
"0.6539162",
"0.65048176",
"0.6441283",
"0.64147156",
"0.64127094",
"0.63864577",
"0.63864577",
"0.63864577",
"0.63864577",
"0.63864577",
"0.63864577",
"0.63864577",
"0.6374098",
"0.6374098",
"0.63705593",
"0.63677025",
"0.63452274",
"0.6233702",
"0.... | 0.0 | -1 |
Calculate a onesided slope. | function slope2(that, t) {
var h = that._x1 - that._x0;
return h ? (3 * (that._y1 - that._y0) / h - t) / 2 : t;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function calculateSlope() {\n let x1 = 2;\n let x2 = 4;\n let firstPointY = 2 * x1 - 2;\n let secondPointY = 2 * x2 - 2;\n return (secondPointY - firstPointY) / (x2 - x1);\n}",
"function slope(a, b) {\n return (b.y - a.y) / (b.x - a.x);\n }",
"function slope(a, b) {\n return (b.y - a.y)... | [
"0.7581995",
"0.74803245",
"0.74803245",
"0.74425995",
"0.74425995",
"0.7222996",
"0.7183728",
"0.7183728",
"0.7183728",
"0.7166007",
"0.7138525",
"0.713446",
"0.71305066",
"0.711682",
"0.7022051",
"0.70193577",
"0.700835",
"0.69189817",
"0.69015527",
"0.6782913",
"0.6677642"... | 0.65396535 | 91 |
Returns true if the given `key` is an own property of `obj`. | function hasOwn(obj, key) {
return Object.prototype.hasOwnProperty.call(obj, key);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function hasOwn(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}",
"function hasOwn(obj, key) {\n\t return Object.prototype.hasOwnProperty.call(obj, key);\n\t}",
"function hasOwn(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key)\n}",
"function hasOwn$1(obj, key) ... | [
"0.76800776",
"0.7679248",
"0.76637346",
"0.7659957",
"0.74843556",
"0.74458146",
"0.7444411",
"0.7415909",
"0.74099565",
"0.73986334",
"0.7389322",
"0.7389322",
"0.7389322",
"0.7389322",
"0.7389322",
"0.73557514",
"0.73463684",
"0.7298799",
"0.72919685",
"0.72887254",
"0.728... | 0.77113444 | 33 |
eslintdisable nobitwise Checks if a given DOM node contains or is another DOM node. | function containsNode(outerNode, innerNode) {
if (!outerNode || !innerNode) {
return false;
} else if (outerNode === innerNode) {
return true;
} else if (isTextNode(outerNode)) {
return false;
} else if (isTextNode(innerNode)) {
return containsNode(outerNode, innerNode.parentNode);
} else if ('contains' in outerNode) {
return outerNode.contains(innerNode);
} else if (outerNode.compareDocumentPosition) {
return !!(outerNode.compareDocumentPosition(innerNode) & 16);
} else {
return false;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isNodeInDOM(node) {\n var ancestor = node;\n while (ancestor.parentNode) {\n ancestor = ancestor.parentNode;\n }\n // ancestor should be a document\n return !!ancestor.body;\n }",
"function isElement(domNode) {\n return domNode.nodeType !== undefined;\... | [
"0.73209375",
"0.7070514",
"0.6997442",
"0.6997442",
"0.69797397",
"0.6879964",
"0.6825696",
"0.67898536",
"0.67599165",
"0.6703535",
"0.6681516",
"0.6681516",
"0.6681516",
"0.6681516",
"0.6681516",
"0.6681516",
"0.66689837",
"0.6650565",
"0.6643169",
"0.66393316",
"0.6622063... | 0.0 | -1 |
Copyright (c) 2013present, Facebook, Inc. This source code is licensed under the MIT license found in the LICENSE file in the root directory of this source tree. | function makeEmptyFunction(arg) {
return function () {
return arg;
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"componentDidMount() {\n // if this is the first time the home screen is loading\n // we must initialize Facebook\n if (!window.FB) {\n window.fbAsyncInit = function() {\n window.FB.init({\n appId : '280945375708713',\n cookie : true, // enable cookies to allow the s... | [
"0.58213997",
"0.56351775",
"0.5554003",
"0.54880005",
"0.53968745",
"0.5384077",
"0.5362144",
"0.53260416",
"0.5321262",
"0.53156716",
"0.53156716",
"0.5291979",
"0.52659994",
"0.52164733",
"0.5197259",
"0.5190788",
"0.51904845",
"0.5154647",
"0.5140113",
"0.51331437",
"0.51... | 0.0 | -1 |
inlined Object.is polyfill to avoid requiring consumers ship their own | function is(x, y) {
// SameValue algorithm
if (x === y) {
// Steps 1-5, 7-10
// Steps 6.b-6.e: +0 != -0
// Added the nonzero y check to make Flow happy, but it is redundant
return x !== 0 || y !== 0 || 1 / x === 1 / y;
} else {
// Step 6.a: NaN == NaN
return x !== x && y !== y;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function i(e){return!0===\n/*!\n * isobject <https://github.com/jonschlinkert/isobject>\n *\n * Copyright (c) 2014-2017, Jon Schlinkert.\n * Released under the MIT License.\n */\nfunction(e){return null!=e&&\"object\"==typeof e&&!1===Array.isArray(e)}(e)&&\"[object Object]\"===Object.prototype.toString.call(e)}",
... | [
"0.7044135",
"0.6979357",
"0.68574303",
"0.6821805",
"0.68029666",
"0.67803156",
"0.6729492",
"0.67206",
"0.6709456",
"0.66839457",
"0.6676559",
"0.6676559",
"0.6676559",
"0.66488636",
"0.6640003",
"0.6640003",
"0.6640003",
"0.6640003",
"0.6625777",
"0.6623136",
"0.6623136",
... | 0.0 | -1 |
Performs equality by iterating through keys on an object and returning false when any key has values which are not strictly equal between the arguments. Returns true when the values of all keys are strictly equal. | function shallowEqual(objA, objB) {
if (is(objA, objB)) {
return true;
}
if (typeof objA !== 'object' || objA === null || typeof objB !== 'object' || objB === null) {
return false;
}
var keysA = Object.keys(objA);
var keysB = Object.keys(objB);
if (keysA.length !== keysB.length) {
return false;
}
// Test for A's keys different from B.
for (var i = 0; i < keysA.length; i++) {
if (!hasOwnProperty.call(objB, keysA[i]) || !is(objA[keysA[i]], objB[keysA[i]])) {
return false;
}
}
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function equalForKeys(a, b, keys) {\n if (!angular.isArray(keys) && angular.isObject(keys)) {\n keys = protoKeys(keys, [\"$$keys\", \"$$values\", \"$$equals\", \"$$validates\", \"$$new\", \"$$parent\"]);\n }\n if (!keys) {\n keys = [];\n for (var n in a) keys.push(n)... | [
"0.6573566",
"0.6573566",
"0.64670867",
"0.6455202",
"0.643334",
"0.6335227",
"0.6295365",
"0.6271248",
"0.6240487",
"0.62244165",
"0.6215123",
"0.61840254",
"0.615888",
"0.6129564",
"0.61267",
"0.6074246",
"0.603424",
"0.6014015",
"0.60044837",
"0.59774935",
"0.5975783",
"... | 0.0 | -1 |
If you need to support Safari 57 (810 yrold browser), take a look at | function isBuffer(val) {
return val.constructor
&& typeof val.constructor.isBuffer === 'function'
&& val.constructor.isBuffer(val);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isSafari() {\n let isSafari = navigator.vendor && navigator.vendor.indexOf('Apple') > -1 &&\n navigator.userAgent &&\n navigator.userAgent.indexOf('CriOS') == -1 &&\n navigator.userAgent.indexOf('FxiOS') == -1;\n\n if (isSafari) {\n document.getElementById('wrapper').classList.add('s... | [
"0.6860666",
"0.6858721",
"0.6842412",
"0.68269986",
"0.6607409",
"0.66046786",
"0.66046786",
"0.66046786",
"0.66046786",
"0.6576386",
"0.6533261",
"0.65117216",
"0.6499543",
"0.6499543",
"0.6499543",
"0.64812416",
"0.64658344",
"0.64658344",
"0.64658344",
"0.64658344",
"0.64... | 0.0 | -1 |
Indents every line in a string. Empty lines (\n only) are not indented. | function indentString(string, spaces) {
var ind = common.repeat(' ', spaces),
position = 0,
next = -1,
result = '',
line,
length = string.length;
while (position < length) {
next = string.indexOf('\n', position);
if (next === -1) {
line = string.slice(position);
position = length;
} else {
line = string.slice(position, next + 1);
position = next + 1;
}
if (line.length && line !== '\n') result += ind;
result += line;
}
return result;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function indentString$1(string, spaces) {\n var ind = common$5.repeat(' ', spaces),\n position = 0,\n next = -1,\n result = '',\n line,\n length = string.length;\n\n while (position < length) {\n next = string.indexOf('\\n', position);\n if (next === -1) {\n line = string.slic... | [
"0.6786829",
"0.67142516",
"0.6687751",
"0.6651403",
"0.6651403",
"0.6651403",
"0.6598248",
"0.65797234",
"0.65418786",
"0.6412618",
"0.6160087",
"0.6160087",
"0.6103218",
"0.60988843",
"0.6044039",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",
"0.6014744",... | 0.6739443 | 21 |
[33] swhite ::= sspace | stab | function isWhitespace(c) {
return c === CHAR_SPACE || c === CHAR_TAB;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function white() {\r\n var c = walker.ch,\r\n token = '';\r\n \r\n while (c === \" \" || c === \"\\t\") {\r\n token += c;\r\n c = walker.nextChar();\r\n }\r\n \r\n tokener(token, 'white');\r\n \r\n }",
"function matchWhite() {\n\t\tvar pattern = /^(\\s|\\n|\\t)/;\n\t\tvar x = lexSt... | [
"0.71999675",
"0.63202614",
"0.6066033",
"0.60659677",
"0.60659677",
"0.6039607",
"0.5978178",
"0.5901559",
"0.5901559",
"0.5816258",
"0.5816258",
"0.5816258",
"0.58161986",
"0.5756463",
"0.5749449",
"0.5690292",
"0.5690292",
"0.5649742",
"0.55242056",
"0.54569775",
"0.545697... | 0.0 | -1 |
Simplified test for values allowed after the first character in plain style. | function isPlainSafe(c) {
// Uses a subset of nb-char - c-flow-indicator - ":" - "#"
// where nb-char ::= c-printable - b-char - c-byte-order-mark.
return isPrintable(c) && c !== 0xFEFF
// - c-flow-indicator
&& c !== CHAR_COMMA
&& c !== CHAR_LEFT_SQUARE_BRACKET
&& c !== CHAR_RIGHT_SQUARE_BRACKET
&& c !== CHAR_LEFT_CURLY_BRACKET
&& c !== CHAR_RIGHT_CURLY_BRACKET
// - ":" - "#"
&& c !== CHAR_COLON
&& c !== CHAR_SHARP;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n return isPrintable(c) && c !== 0xFEFF\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !==... | [
"0.6716499",
"0.6716499",
"0.6716499",
"0.6716499",
"0.6716499",
"0.6716499",
"0.6716499",
"0.6716499",
"0.6716499",
"0.6710389",
"0.6710389",
"0.6710389",
"0.66741455",
"0.66741455",
"0.66741455",
"0.66741455",
"0.66741455",
"0.66741455",
"0.66741455",
"0.66741455",
"0.66741... | 0.0 | -1 |
Simplified test for values allowed as the first character in plain style. | function isPlainSafeFirst(c) {
// Uses a subset of ns-char - c-indicator
// where ns-char = nb-char - s-white.
return isPrintable(c) && c !== 0xFEFF
&& !isWhitespace(c) // - s-white
// - (c-indicator ::=
// “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”
&& c !== CHAR_MINUS
&& c !== CHAR_QUESTION
&& c !== CHAR_COLON
&& c !== CHAR_COMMA
&& c !== CHAR_LEFT_SQUARE_BRACKET
&& c !== CHAR_RIGHT_SQUARE_BRACKET
&& c !== CHAR_LEFT_CURLY_BRACKET
&& c !== CHAR_RIGHT_CURLY_BRACKET
// | “#” | “&” | “*” | “!” | “|” | “>” | “'” | “"”
&& c !== CHAR_SHARP
&& c !== CHAR_AMPERSAND
&& c !== CHAR_ASTERISK
&& c !== CHAR_EXCLAMATION
&& c !== CHAR_VERTICAL_LINE
&& c !== CHAR_GREATER_THAN
&& c !== CHAR_SINGLE_QUOTE
&& c !== CHAR_DOUBLE_QUOTE
// | “%” | “@” | “`”)
&& c !== CHAR_PERCENT
&& c !== CHAR_COMMERCIAL_AT
&& c !== CHAR_GRAVE_ACCENT;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isPlainSafeFirst(c) {\n // Uses a subset of ns-char - c-indicator\n // where ns-char = nb-char - s-white.\n return isPrintable(c) && c !== 0xFEFF\n && !isWhitespace(c) // - s-white\n // - (c-indicator ::=\n // “-” | “?” | “:” | “,” | “[” | “]” | “{” | “}”\n && c !== CHAR_MINUS\n && c !==... | [
"0.69060594",
"0.69060594",
"0.69060594",
"0.69060594",
"0.69060594",
"0.69060594",
"0.69060594",
"0.69060594",
"0.69060594",
"0.6874973",
"0.6874973",
"0.6874973",
"0.6716959",
"0.6699953",
"0.6699953",
"0.6699953",
"0.6699953",
"0.64679575",
"0.6443986",
"0.64386994",
"0.63... | 0.68719757 | 22 |
Determines whether block indentation indicator is required. | function needIndentIndicator(string) {
var leadingSpaceRe = /^\n* /;
return leadingSpaceRe.test(string);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function needIndentIndicator$1(string) {\n var leadingSpaceRe = /^\\n* /;\n return leadingSpaceRe.test(string);\n}",
"indentation() {\n var _a;\n return (_a = this.overrideIndent) !== null && _a !== void 0 ? _a : countCol(this.string, null, this.tabSize);\n }",
"isNextLineIndented(ignoreComm... | [
"0.6787066",
"0.63313544",
"0.6041281",
"0.6031409",
"0.59672546",
"0.5964364",
"0.59153175",
"0.5908457",
"0.5908457",
"0.5908457",
"0.5908457",
"0.5908457",
"0.56096697",
"0.5475761",
"0.5385763",
"0.5381619",
"0.537914",
"0.5349726",
"0.52810466",
"0.526711",
"0.5263013",
... | 0.67317927 | 22 |
Determines which scalar styles are possible and returns the preferred style. lineWidth = 1 => no limit. Preconditions: str.length > 0. Postconditions: STYLE_PLAIN or STYLE_SINGLE => no \n are in the string. STYLE_LITERAL => no lines are suitable for folding (or lineWidth is 1). STYLE_FOLDED => a line > lineWidth and can be folded (and lineWidth != 1). | function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth, testAmbiguousType) {
var i;
var char;
var hasLineBreak = false;
var hasFoldableLine = false; // only checked if shouldTrackWidth
var shouldTrackWidth = lineWidth !== -1;
var previousLineBreak = -1; // count the first line correctly
var plain = isPlainSafeFirst(string.charCodeAt(0))
&& !isWhitespace(string.charCodeAt(string.length - 1));
if (singleLineOnly) {
// Case: no block styles.
// Check for disallowed characters to rule out plain and single.
for (i = 0; i < string.length; i++) {
char = string.charCodeAt(i);
if (!isPrintable(char)) {
return STYLE_DOUBLE;
}
plain = plain && isPlainSafe(char);
}
} else {
// Case: block styles permitted.
for (i = 0; i < string.length; i++) {
char = string.charCodeAt(i);
if (char === CHAR_LINE_FEED) {
hasLineBreak = true;
// Check if any line can be folded.
if (shouldTrackWidth) {
hasFoldableLine = hasFoldableLine ||
// Foldable line = too long, and not more-indented.
(i - previousLineBreak - 1 > lineWidth &&
string[previousLineBreak + 1] !== ' ');
previousLineBreak = i;
}
} else if (!isPrintable(char)) {
return STYLE_DOUBLE;
}
plain = plain && isPlainSafe(char);
}
// in case the end is missing a \n
hasFoldableLine = hasFoldableLine || (shouldTrackWidth &&
(i - previousLineBreak - 1 > lineWidth &&
string[previousLineBreak + 1] !== ' '));
}
// Although every style can represent \n without escaping, prefer block styles
// for multiline, since they're more readable and they don't add empty lines.
// Also prefer folding a super-long line.
if (!hasLineBreak && !hasFoldableLine) {
// Strings interpretable as another type have to be quoted;
// e.g. the string 'true' vs. the boolean true.
return plain && !testAmbiguousType(string)
? STYLE_PLAIN : STYLE_SINGLE;
}
// Edge case: block indentation indicator can only have one digit.
if (indentPerLevel > 9 && needIndentIndicator(string)) {
return STYLE_DOUBLE;
}
// At this point we know block styles are valid.
// Prefer literal style unless we want to fold.
return hasFoldableLine ? STYLE_FOLDED : STYLE_LITERAL;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function chooseScalarStyle(string, singleLineOnly, indentPerLevel, lineWidth, testAmbiguousType) {\n var i;\n var char, prev_char;\n var hasLineBreak = false;\n var hasFoldableLine = false; // only checked if shouldTrackWidth\n var shouldTrackWidth = lineWidth !== -1;\n var previousLineBreak = -1; // count t... | [
"0.76291645",
"0.76291645",
"0.76291645",
"0.76291645",
"0.76291645",
"0.76291645",
"0.76291645",
"0.76291645",
"0.76291645",
"0.75900143",
"0.7569788",
"0.7569788",
"0.7569788",
"0.75559837",
"0.7417766",
"0.7417766",
"0.7417766",
"0.7417766",
"0.5697013",
"0.5654883",
"0.54... | 0.75900143 | 19 |
Preconditions: string is valid for a block scalar, 1 <= indentPerLevel <= 9. | function blockHeader(string, indentPerLevel) {
var indentIndicator = needIndentIndicator(string) ? String(indentPerLevel) : '';
// note the special case: the string '\n' counts as a "trailing" empty line.
var clip = string[string.length - 1] === '\n';
var keep = clip && (string[string.length - 2] === '\n' || string === '\n');
var chomp = keep ? '+' : (clip ? '' : '-');
return indentIndicator + chomp + '\n';
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function blockStringValue(rawString) {\n // Expand a block string's raw value into independent lines.\n var lines = rawString.split(/\\r\\n|[\\n\\r]/g); // Remove common indentation from all lines but first.\n\n var commonIndent = null;\n\n for (var i = 1; i < lines.length; i++) {\n var line = lines[i];\n ... | [
"0.61747354",
"0.61747354",
"0.6094623",
"0.60905737",
"0.6074551",
"0.6069336",
"0.60691166",
"0.606905",
"0.606905",
"0.606905",
"0.606905",
"0.606905",
"0.6058055",
"0.6058055",
"0.6042766",
"0.6042766",
"0.6042766",
"0.6025677",
"0.60222024",
"0.6014868",
"0.599498",
"0... | 0.5916536 | 53 |
(See the note for writeScalar.) | function dropEndingNewline(string) {
return string[string.length - 1] === '\n' ? string.slice(0, -1) : string;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function scalarScalar(a, b) {\n\t var x = a + b\n\t var bv = x - a\n\t var av = x - bv\n\t var br = b - bv\n\t var ar = a - av\n\t var y = ar + br\n\t if(y) {\n\t return [y, x]\n\t }\n\t return [x]\n\t}",
"function scalarScalar(a, b) {\n\t var x = a + b\n\t var bv = x - a\n\t var av = x - bv\n\t ... | [
"0.57324404",
"0.57324404",
"0.57324404",
"0.57324404",
"0.57324404",
"0.57324404",
"0.57324404",
"0.57324404",
"0.57324404",
"0.57324404",
"0.5670208",
"0.5642623",
"0.56310874",
"0.5620793",
"0.5614877",
"0.5605067",
"0.5533351",
"0.55127835",
"0.5507258",
"0.5507258",
"0.5... | 0.0 | -1 |
Note: a long line without a suitable break point will exceed the width limit. Preconditions: every char in str isPrintable, str.length > 0, width > 0. | function foldString(string, width) {
// In folded style, $k$ consecutive newlines output as $k+1$ newlines—
// unless they're before or after a more-indented line, or at the very
// beginning or end, in which case $k$ maps to $k$.
// Therefore, parse each chunk as newline(s) followed by a content line.
var lineRe = /(\n+)([^\n]*)/g;
// first line (possibly an empty line)
var result = (function () {
var nextLF = string.indexOf('\n');
nextLF = nextLF !== -1 ? nextLF : string.length;
lineRe.lastIndex = nextLF;
return foldLine(string.slice(0, nextLF), width);
}());
// If we haven't reached the first content line yet, don't add an extra \n.
var prevMoreIndented = string[0] === '\n' || string[0] === ' ';
var moreIndented;
// rest of the lines
var match;
while ((match = lineRe.exec(string))) {
var prefix = match[1], line = match[2];
moreIndented = (line[0] === ' ');
result += prefix
+ (!prevMoreIndented && !moreIndented && line !== ''
? '\n' : '')
+ foldLine(line, width);
prevMoreIndented = moreIndented;
}
return result;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function wordWrap(str, width) {\n\t\tif (str.length <= width) return str;\n\t\tvar count = 0;\n\t\tvar newStr = [];\n\t\tfor (const char of str) {\n\t\t\tcount++;\n\t\t\tif (char === \"\\n\") {\n\t\t\t\tnewStr.push(char);\n\t\t\t\tcount = 0;\n\t\t\t} else if (count >= width) {\n\t\t\t\tnewStr.push(char + \"\\n\");... | [
"0.67308474",
"0.64998955",
"0.6404971",
"0.63891506",
"0.62890816",
"0.6250449",
"0.62337464",
"0.62337464",
"0.62337464",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.6182557",
"0.618255... | 0.5447545 | 90 |
Greedy line breaking. Picks the longest line under the limit each time, otherwise settles for the shortest line over the limit. NB. Moreindented lines cannot be folded, as that would add an extra \n. | function foldLine(line, width) {
if (line === '' || line[0] === ' ') return line;
// Since a more-indented line adds a \n, breaks can't be followed by a space.
var breakRe = / [^ ]/g; // note: the match index will always be <= length-2.
var match;
// start is an inclusive index. end, curr, and next are exclusive.
var start = 0, end, curr = 0, next = 0;
var result = '';
// Invariants: 0 <= start <= length-1.
// 0 <= curr <= next <= max(0, length-2). curr - start <= width.
// Inside the loop:
// A match implies length >= 2, so curr and next are <= length-2.
while ((match = breakRe.exec(line))) {
next = match.index;
// maintain invariant: curr - start <= width
if (next - start > width) {
end = (curr > start) ? curr : next; // derive end <= length-2
result += '\n' + line.slice(start, end);
// skip the space that was output as \n
start = end + 1; // derive start <= length-1
}
curr = next;
}
// By the invariants, start <= length-1, so there is something left over.
// It is either the whole string or a part starting from non-whitespace.
result += '\n';
// Insert a break if the remainder is too long and there is a break available.
if (line.length - start > width && curr > start) {
result += line.slice(start, curr) + '\n' + line.slice(curr + 1);
} else {
result += line.slice(start);
}
return result.slice(1); // drop extra \n joiner
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"_maxLineHack() {\n var display = this.cm.display, curOp = this.cm.curOp;\n const CLEARANCE = 3; /* space added to the right, in characters */\n display.maxLineChanged = false;\n if (curOp) {\n curOp.updateMaxLine = false;\n curOp.adjustWidthTo = (display.maxLine.t... | [
"0.61912745",
"0.6155772",
"0.6136653",
"0.60758495",
"0.59446704",
"0.5905801",
"0.5903518",
"0.5903518",
"0.5903518",
"0.5895008",
"0.5859297",
"0.58386946",
"0.5632553",
"0.5621985",
"0.55997616",
"0.55528784",
"0.5539872",
"0.5539821",
"0.55261034",
"0.5514364",
"0.549796... | 0.5902871 | 29 |
Escapes a doublequoted string. | function escapeString(string) {
var result = '';
var char, nextChar;
var escapeSeq;
for (var i = 0; i < string.length; i++) {
char = string.charCodeAt(i);
// Check for surrogate pairs (reference Unicode 3.0 section "3.7 Surrogates").
if (char >= 0xD800 && char <= 0xDBFF/* high surrogate */) {
nextChar = string.charCodeAt(i + 1);
if (nextChar >= 0xDC00 && nextChar <= 0xDFFF/* low surrogate */) {
// Combine the surrogate pair and store it escaped.
result += encodeHex((char - 0xD800) * 0x400 + nextChar - 0xDC00 + 0x10000);
// Advance index one extra since we already used that char here.
i++; continue;
}
}
escapeSeq = ESCAPE_SEQUENCES[char];
result += !escapeSeq && isPrintable(char)
? string[i]
: escapeSeq || encodeHex(char);
}
return result;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function escapeDoubleQuotes(text) {\n\treturn text.replace(/\"/g, '\\\\\"');\n}",
"function esc(v) { return \"\\\"\" + v.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, \"\\\\\\\"\") + \"\\\"\"; }",
"function esc(v) { return \"\\\"\" + v.replace(/\\\\/g, \"\\\\\\\\\").replace(/\"/g, \"\\\\\\\"\") + \"\\\"\"; }",... | [
"0.75086665",
"0.73967606",
"0.73967606",
"0.73967606",
"0.73967606",
"0.7339402",
"0.732685",
"0.7322355",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",
"0.7151227",... | 0.0 | -1 |
Serializes `object` and writes it to global `result`. Returns true on success, or false on invalid object. | function writeNode(state, level, object, block, compact, iskey) {
state.tag = null;
state.dump = object;
if (!detectType(state, object, false)) {
detectType(state, object, true);
}
var type = _toString.call(state.dump);
if (block) {
block = (state.flowLevel < 0 || state.flowLevel > level);
}
var objectOrArray = type === '[object Object]' || type === '[object Array]',
duplicateIndex,
duplicate;
if (objectOrArray) {
duplicateIndex = state.duplicates.indexOf(object);
duplicate = duplicateIndex !== -1;
}
if ((state.tag !== null && state.tag !== '?') || duplicate || (state.indent !== 2 && level > 0)) {
compact = false;
}
if (duplicate && state.usedDuplicates[duplicateIndex]) {
state.dump = '*ref_' + duplicateIndex;
} else {
if (objectOrArray && duplicate && !state.usedDuplicates[duplicateIndex]) {
state.usedDuplicates[duplicateIndex] = true;
}
if (type === '[object Object]') {
if (block && (Object.keys(state.dump).length !== 0)) {
writeBlockMapping(state, level, state.dump, compact);
if (duplicate) {
state.dump = '&ref_' + duplicateIndex + state.dump;
}
} else {
writeFlowMapping(state, level, state.dump);
if (duplicate) {
state.dump = '&ref_' + duplicateIndex + ' ' + state.dump;
}
}
} else if (type === '[object Array]') {
if (block && (state.dump.length !== 0)) {
writeBlockSequence(state, level, state.dump, compact);
if (duplicate) {
state.dump = '&ref_' + duplicateIndex + state.dump;
}
} else {
writeFlowSequence(state, level, state.dump);
if (duplicate) {
state.dump = '&ref_' + duplicateIndex + ' ' + state.dump;
}
}
} else if (type === '[object String]') {
if (state.tag !== '?') {
writeScalar(state, state.dump, level, iskey);
}
} else {
if (state.skipInvalid) return false;
throw new YAMLException('unacceptable kind of an object to dump ' + type);
}
if (state.tag !== null && state.tag !== '?') {
state.dump = '!<' + state.tag + '> ' + state.dump;
}
}
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"stringify(object) {\n return JSON.stringify(object)\n }",
"function serialize(object, options = {}) {\n // Unpack the options\n const checkKeys = typeof options.checkKeys === 'boolean' ? options.checkKeys : false;\n const serializeFunctions = typeof options.serializeFunctions === 'boolean' ? o... | [
"0.55372435",
"0.550772",
"0.5396421",
"0.5378927",
"0.53609836",
"0.5304392",
"0.5290606",
"0.5290606",
"0.5266007",
"0.52468634",
"0.5243715",
"0.5241914",
"0.523814",
"0.5174504",
"0.5168797",
"0.5143203",
"0.51339746",
"0.51178324",
"0.51143724",
"0.51099664",
"0.5109823"... | 0.0 | -1 |
The function whose prototype chain sequence wrappers inherit from. | function baseLodash() {
// No operation performed.
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get prototype() {}",
"function FunctionWithPrototypeTest() {}",
"function n(e,t){e.prototype.__proto__=t&&t.prototype,e.__proto__=t}",
"function inheritFrom(subfn,superfn) {\n\tvar r = function () {}\n\tr.prototype = superfn.prototype;\n\tsubfn.prototype = new r();\n}",
"function m(a){var b=function(){};re... | [
"0.63432866",
"0.6205933",
"0.58863425",
"0.583783",
"0.5753452",
"0.5729398",
"0.5729398",
"0.5718173",
"0.5718173",
"0.5718173",
"0.5718173",
"0.5718173",
"0.5715005",
"0.5715005",
"0.5678385",
"0.5678385",
"0.5678385",
"0.5678385",
"0.5678385",
"0.5678385",
"0.5678385",
... | 0.0 | -1 |
Removes all keyvalue entries from the hash. | function hashClear() {
this.__data__ = nativeCreate ? nativeCreate(null) : {};
this.size = 0;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }",
"function clear() {\n this.keys.forEach((key) => {\n this._store[key] = undefined;\n delete this._store[key];\n });\n}",
... | [
"0.67331547",
"0.66229314",
"0.65130246",
"0.6456053",
"0.62131137",
"0.6201214",
"0.6139392",
"0.61100906",
"0.6029288",
"0.5966744",
"0.59360605",
"0.59072584",
"0.59072584",
"0.59072584",
"0.59040016",
"0.5900616",
"0.5900616",
"0.5900616",
"0.58648694",
"0.58648694",
"0.5... | 0.0 | -1 |
Removes all keyvalue entries from the list cache. | function listCacheClear() {
this.__data__ = [];
this.size = 0;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function listCacheClear(){this.__data__=[];}",
"function listCacheClear(){this.__data__=[];}",
"function listCacheClear(){this.__data__=[];}",
"function listCacheClear(){this.__data__=[];}",
"function listCacheClear() {\n\t\t this.__data__ = [];\n\t\t this.size = 0;\n\t\t}",
"function listCacheClear() ... | [
"0.7357779",
"0.7357779",
"0.7357779",
"0.7357779",
"0.7317932",
"0.72645503",
"0.72645503",
"0.7262977",
"0.72569066",
"0.72569066",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7236393",
"0.7234546",... | 0.0 | -1 |
Removes all keyvalue entries from the map. | function mapCacheClear() {
this.size = 0;
this.__data__ = {
'hash': new Hash,
'map': new (Map || ListCache),
'string': new Hash
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"clear() {\n var map = this._map;\n var keys = Object.keys(map);\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n map[key].clear();\n }\n }",
"clear() {\n log.map(\"Clearing the map of all the entries\");\n this._map.clear();\n }",
"function multiMapRemo... | [
"0.7590112",
"0.70694387",
"0.6735414",
"0.6652174",
"0.6530006",
"0.6267597",
"0.62582785",
"0.62582785",
"0.62582785",
"0.617115",
"0.617115",
"0.617115",
"0.6166302",
"0.61519635",
"0.614778",
"0.614778",
"0.614778",
"0.614778",
"0.614778",
"0.614778",
"0.614778",
"0.614... | 0.0 | -1 |
Removes all keyvalue entries from the stack. | function stackClear() {
this.__data__ = new ListCache;
this.size = 0;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"clear () {\n this._dict = {}\n this._stack = [this._dict]\n }",
"function stackClear(){this.__data__={'array':[],'map':null};}",
"function stackClear(){this.__data__={'array':[],'map':null};}",
"function stackClear(){this.__data__={'array':[],'map':null};}",
"function stackClear() {\n\t this.__... | [
"0.63577217",
"0.63291264",
"0.63291264",
"0.63291264",
"0.62734073",
"0.62274295",
"0.62274295",
"0.62274295",
"0.62274295",
"0.62274295",
"0.62274295",
"0.62274295",
"0.62171006",
"0.62171006",
"0.62171006",
"0.62171006",
"0.62171006",
"0.62171006",
"0.62171006",
"0.62171006"... | 0.0 | -1 |
This method returns `undefined`. | function noop() {
// No operation performed.
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function returnUndefined() {}",
"value() { return undefined; }",
"function _undefined() {\n return exports.PREFIX.undefined;\n}",
"function f () {\n return undefined;\n }",
"_get(key) { return undefined; }",
"get None() {}",
"get None() {}",
"get None() {}",
"get None() {}",
"_get_value() ... | [
"0.7349204",
"0.67813563",
"0.6498075",
"0.6468386",
"0.6265139",
"0.6195519",
"0.6195519",
"0.6195519",
"0.6195519",
"0.5957684",
"0.5942946",
"0.5942946",
"0.59360754",
"0.5919196",
"0.5828133",
"0.5788914",
"0.57824624",
"0.5770755",
"0.5736466",
"0.5725097",
"0.57073194",... | 0.0 | -1 |
a State is a rule at a position from a given starting point in the input stream (reference) | function State(rule, dot, reference, wantedBy) {
this.rule = rule;
this.dot = dot;
this.reference = reference;
this.data = [];
this.wantedBy = wantedBy;
this.isComplete = this.dot === rule.symbols.length;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function State(rule, dot, reference, wantedBy) {\n this.rule = rule;\n this.dot = dot;\n this.reference = reference;\n this.data = [];\n this.wantedBy = wantedBy;\n this.isComplete = this.dot === rule.symbols.length;\n}",
"function State(rule,dot,reference,wantedBy){this.rule=rule;this.dot=dot;... | [
"0.65215415",
"0.64577216",
"0.58783334",
"0.57574743",
"0.5714121",
"0.5601528",
"0.5595379",
"0.55100155",
"0.55064565",
"0.54768157",
"0.5473086",
"0.5473086",
"0.54487634",
"0.54456496",
"0.5404044",
"0.5404044",
"0.5393336",
"0.53770375",
"0.53709704",
"0.53709704",
"0.5... | 0.6425298 | 3 |
v8 likes predictible objects | function Item(fun, array) {
this.fun = fun;
this.array = array;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function compareLike(a,b){\n var al = a.idLikesProp.length;\n var bl = b.idLikesProp.length;\n if(al > bl) return -1;\n if(bl > al) return 1;\n return 0;\n}",
"function lookAround() {\n var objectDescription = \"\"\n tj.see().then(function(objects) {\n objects.forEach(function(each) {\n ... | [
"0.527866",
"0.52612406",
"0.51951283",
"0.518796",
"0.51302594",
"0.5044646",
"0.48934332",
"0.4857401",
"0.484017",
"0.48302925",
"0.482028",
"0.4812441",
"0.4808473",
"0.47852293",
"0.47828078",
"0.47574478",
"0.47493434",
"0.4739314",
"0.47239366",
"0.4703992",
"0.4703992... | 0.0 | -1 |
inlined Object.is polyfill to avoid requiring consumers ship their own /eslintdisable noselfcompare | function is(x, y) {
// SameValue algorithm
if (x === y) {
// Steps 1-5, 7-10
// Steps 6.b-6.e: +0 != -0
return x !== 0 || 1 / x === 1 / y;
} else {
// Step 6.a: NaN == NaN
return x !== x && y !== y;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isObject$1(obj) {\n // incase of arrow function and array\n return Object(obj) === obj && String(obj) === '[object Object]' && !isFunction(obj) && !isArray(obj);\n }",
"function isObject$1(obj) {\n ... | [
"0.6732616",
"0.6635038",
"0.661072",
"0.6601085",
"0.6600715",
"0.6566089",
"0.65076286",
"0.64694375",
"0.64637655",
"0.6413088",
"0.63718337",
"0.6366774",
"0.6366774",
"0.6366774",
"0.6366774",
"0.63587356",
"0.63286597",
"0.632346",
"0.6322866",
"0.62971216",
"0.62971216... | 0.0 | -1 |
Equivalent of `typeof` but with special handling for array and regexp. | function getPropType(propValue) {
var propType = typeof propValue;
if (Array.isArray(propValue)) {
return 'array';
}
if (propValue instanceof RegExp) {
// Old webkits (at least until Android 4.0) return 'function' rather than
// 'object' for typeof a RegExp. We'll normalize this here so that /bla/
// passes PropTypes.object.
return 'object';
}
if (isSymbol(propType, propValue)) {
return 'symbol';
}
return propType;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function sc_typeof( x ) {\n return typeof x;\n}",
"static type(arg)\n {\n const types = [\n 'array', 'boolean', 'function', 'number',\n 'null', 'object', 'regexp', 'symbol', 'string',\n 'undefined'\n ]\n\n var type = Object.prototype.toString.call(arg),\... | [
"0.6908266",
"0.67753035",
"0.6608242",
"0.65383387",
"0.6493603",
"0.6488205",
"0.6488205",
"0.645129",
"0.645129",
"0.6428518",
"0.64284635",
"0.64030594",
"0.64030594",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
"0.6395142",
... | 0.0 | -1 |
This handles more types than `getPropType`. Only used for error messages. See `createPrimitiveTypeChecker`. | function getPreciseType(propValue) {
if (typeof propValue === 'undefined' || propValue === null) {
return '' + propValue;
}
var propType = getPropType(propValue);
if (propType === 'object') {
if (propValue instanceof Date) {
return 'date';
} else if (propValue instanceof RegExp) {
return 'regexp';
}
}
return propType;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getPropType(propValue) {\n\t\t var propType = typeof propValue;\n\t\t if (Array.isArray(propValue)) {\n\t\t return 'array';\n\t\t }\n\t\t if (propValue instanceof RegExp) {\n\t\t // Old webkits (at least until Android 4.0) return 'function' rather than\n\t\t // 'object' for type... | [
"0.68783337",
"0.6854942",
"0.6854942",
"0.6854942",
"0.6854942",
"0.6853652",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"0.68482035",
"... | 0.0 | -1 |
Returns a string that is postfixed to a warning about an invalid type. For example, "undefined" or "of type array" | function getPostfixForTypeWarning(value) {
var type = getPreciseType(value);
switch (type) {
case 'array':
case 'object':
return 'an ' + type;
case 'boolean':
case 'date':
case 'regexp':
return 'a ' + type;
default:
return type;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function _undefinedCoerce() {\n return '';\n}",
"function getPostfixForTypeWarning(value) {\n var type = getPreciseType(value);\n switch (type) {\n case \"array\":\n case \"object\":\n return \"an \" + type;\n case \"boolean\":\n ... | [
"0.65988296",
"0.6565237",
"0.6559532",
"0.6559532",
"0.6559532",
"0.6559532",
"0.6522337",
"0.65215486",
"0.65060395",
"0.65060395",
"0.65060395",
"0.65060395",
"0.65060395",
"0.65013695",
"0.6489755",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.6477735",
"0.64777... | 0.0 | -1 |
Returns class name of the object, if any. | function getClassName(propValue) {
if (!propValue.constructor || !propValue.constructor.name) {
return ANONYMOUS;
}
return propValue.constructor.name;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getClassName(obj) {\n var funcNameRegex = /function\\s+(.+?)\\s*\\(/;\n var results = funcNameRegex.exec(obj['constructor'].toString());\n return (results && results.length > 1) ? results[1] : '';\n }",
"getClassName() {\n return this.constructor\n .className;\n... | [
"0.7730571",
"0.74697196",
"0.74697196",
"0.74258965",
"0.7164231",
"0.71448183",
"0.7083163",
"0.7080694",
"0.6995368",
"0.6971116",
"0.6901662",
"0.6883398",
"0.67147285",
"0.66557264",
"0.6639163",
"0.6611592",
"0.6611592",
"0.6611592",
"0.6611592",
"0.6600893",
"0.6599787... | 0.0 | -1 |
Create a factory that creates HTML tag elements. | function createDOMFactory(type) {
var factory = React.createElement.bind(null, type);
// Expose the type on the factory and the prototype so that it can be
// easily accessed on elements. E.g. `<Foo />.type === Foo`.
// This should not be named `constructor` since this may not be the function
// that created the element, and it may not even be a constructor.
factory.type = type;
return factory;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function createEl(tag){\n return document.createElement(tag);\n}",
"function elementFactory(tag, text, css) {\n var element = document.createElement(tag);\n var innerHTML = document.createTextNode(text);\n\n element.appendChild(innerHTML);\n if(css !== '') {\n if(typeof css === 'string') {\n eleme... | [
"0.7087224",
"0.7012231",
"0.68404186",
"0.67985576",
"0.67218196",
"0.6653159",
"0.6594526",
"0.6592767",
"0.655653",
"0.6549683",
"0.6536307",
"0.65296376",
"0.6521061",
"0.6510798",
"0.646388",
"0.64369357",
"0.6434278",
"0.6424656",
"0.6404411",
"0.63769203",
"0.6364542",... | 0.600104 | 65 |
Recomputes the plugin list using the injected plugins and plugin ordering. | function recomputePluginOrdering() {
if (!eventPluginOrder) {
// Wait until an `eventPluginOrder` is injected.
return;
}
for (var pluginName in namesToPlugins) {
var pluginModule = namesToPlugins[pluginName];
var pluginIndex = eventPluginOrder.indexOf(pluginName);
!(pluginIndex > -1) ? invariant(false, 'EventPluginRegistry: Cannot inject event plugins that do not exist in the plugin ordering, `%s`.', pluginName) : void 0;
if (plugins[pluginIndex]) {
continue;
}
!pluginModule.extractEvents ? invariant(false, 'EventPluginRegistry: Event plugins must implement an `extractEvents` method, but `%s` does not.', pluginName) : void 0;
plugins[pluginIndex] = pluginModule;
var publishedEvents = pluginModule.eventTypes;
for (var eventName in publishedEvents) {
!publishEventForPlugin(publishedEvents[eventName], pluginModule, eventName) ? invariant(false, 'EventPluginRegistry: Failed to publish event `%s` for plugin `%s`.', eventName, pluginName) : void 0;
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"orderPlugins() {\r\n debug('orderPlugins:before', this.pluginNames);\r\n const runLast = this._plugins\r\n .filter(p => p.requirements.has('runLast'))\r\n .map(p => p.name);\r\n for (const name of runLast) {\r\n const index = this._plugins.findIndex(p => p.name... | [
"0.7994826",
"0.74705356",
"0.71697074",
"0.7136579",
"0.7136579",
"0.7136579",
"0.71291363",
"0.7123043",
"0.7119059",
"0.71177113",
"0.71177113",
"0.71177113",
"0.710143",
"0.710143",
"0.710143",
"0.70917714",
"0.70917714",
"0.70917714",
"0.70917714",
"0.70917714",
"0.70917... | 0.0 | -1 |
Standard/simple iteration through an event's collected dispatches. | function executeDispatchesInOrder(event, simulated) {
var dispatchListeners = event._dispatchListeners;
var dispatchInstances = event._dispatchInstances;
{
validateEventDispatches(event);
}
if (Array.isArray(dispatchListeners)) {
for (var i = 0; i < dispatchListeners.length; i++) {
if (event.isPropagationStopped()) {
break;
}
// Listeners and Instances are two parallel arrays that are always in sync.
executeDispatch(event, simulated, dispatchListeners[i], dispatchInstances[i]);
}
} else if (dispatchListeners) {
executeDispatch(event, simulated, dispatchListeners, dispatchInstances);
}
event._dispatchListeners = null;
event._dispatchInstances = null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function forEachEventDispatch(event,cb){var dispatchListeners=event._dispatchListeners;var dispatchIDs=event._dispatchIDs;if(\"production\"!==process.env.NODE_ENV){validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break... | [
"0.6340201",
"0.6318283",
"0.6216154",
"0.6129209",
"0.6122544",
"0.6122544",
"0.6122544",
"0.6122544",
"0.6122544",
"0.6122544",
"0.6122544",
"0.6122544",
"0.6119329",
"0.6119329",
"0.61154145",
"0.60784554",
"0.60784554",
"0.60784554",
"0.60784554",
"0.60784554",
"0.6078455... | 0.0 | -1 |
Given a DOM node, return the closest ReactDOMComponent or ReactDOMTextComponent instance ancestor. | function getClosestInstanceFromNode(node) {
if (node[internalInstanceKey]) {
return node[internalInstanceKey];
}
while (!node[internalInstanceKey]) {
if (node.parentNode) {
node = node.parentNode;
} else {
// Top of the tree. This node must not be part of a React tree (or is
// unmounted, potentially).
return null;
}
}
var inst = node[internalInstanceKey];
if (inst.tag === HostComponent || inst.tag === HostText) {
// In Fiber, this will always be the deepest root.
return inst;
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getClosestInstanceFromNode(node){if(node[internalInstanceKey]){return node[internalInstanceKey];}while(!node[internalInstanceKey]){if(node.parentNode){node=node.parentNode;}else{// Top of the tree. This node must not be part of a React tree (or is\n// unmounted, potentially).\nreturn null;}}var inst=node[... | [
"0.7372026",
"0.7372026",
"0.7372026",
"0.7372026",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.73251814",
"0.7309252",
"0.7309252",
"0... | 0.0 | -1 |
Given a DOM node, return the ReactDOMComponent or ReactDOMTextComponent instance, or null if the node was not rendered by this React. | function getInstanceFromNode$1(node) {
var inst = node[internalInstanceKey];
if (inst) {
if (inst.tag === HostComponent || inst.tag === HostText) {
return inst;
} else {
return null;
}
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function findDOMNode(node) {\n if (node instanceof HTMLElement) {\n return node;\n }\n if (node instanceof react__WEBPACK_IMPORTED_MODULE_0__.Component) {\n return react_dom__WEBPACK_IMPORTED_MODULE_1__.findDOMNode(node);\n }\n return null;\n}",
"function findFirstReactDOMImpl(node) {\n\t\t // This n... | [
"0.75965786",
"0.7380417",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.7350097",
"0.73300976",
"0.73300976",
"0.73300976",... | 0.0 | -1 |
Given a ReactDOMComponent or ReactDOMTextComponent, return the corresponding DOM node. | function getNodeFromInstance$1(inst) {
if (inst.tag === HostComponent || inst.tag === HostText) {
// In Fiber this, is just the state node right now. We assume it will be
// a host component or host text.
return inst.stateNode;
}
// Without this first invariant, passing a non-DOM-component triggers the next
// invariant for a missing parent, which is super confusing.
invariant(false, 'getNodeFromInstance: Invalid argument.');
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function findFirstReactDOMImpl(node) {\n\t\t // This node might be from another React instance, so we make sure not to\n\t\t // examine the node cache here\n\t\t for (; node && node.parentNode !== node; node = node.parentNode) {\n\t\t if (node.nodeType !== 1) {\n\t\t // Not a DOMElement, therefore not a... | [
"0.67848456",
"0.6778149",
"0.6772021",
"0.6766768",
"0.6766768",
"0.6752285",
"0.67427766",
"0.674125",
"0.674125",
"0.674125",
"0.674125",
"0.674125",
"0.674125",
"0.6741039",
"0.6741039",
"0.6741039",
"0.6741039",
"0.6741039",
"0.6741039",
"0.6741039",
"0.67319804",
"0.6... | 0.0 | -1 |
Return the lowest common ancestor of A and B, or null if they are in different trees. | function getLowestCommonAncestor(instA, instB) {
var depthA = 0;
for (var tempA = instA; tempA; tempA = getParent(tempA)) {
depthA++;
}
var depthB = 0;
for (var tempB = instB; tempB; tempB = getParent(tempB)) {
depthB++;
}
// If A is deeper, crawl up.
while (depthA - depthB > 0) {
instA = getParent(instA);
depthA--;
}
// If B is deeper, crawl up.
while (depthB - depthA > 0) {
instB = getParent(instB);
depthB--;
}
// Walk in lockstep until we find a match.
var depth = depthA;
while (depth--) {
if (instA === instB || instA === instB.alternate) {
return instA;
}
instA = getParent(instA);
instB = getParent(instB);
}
return null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getLowestCommonAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromInstance: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'getNodeFromIns... | [
"0.82778895",
"0.82778895",
"0.82778895",
"0.8273446",
"0.8273446",
"0.8273446",
"0.8255146",
"0.8230099",
"0.8230099",
"0.8230099",
"0.8230099",
"0.8200897",
"0.8200273",
"0.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
"0.8185259",
... | 0.0 | -1 |
Return if A is an ancestor of B. Return the parent instance of the passedin instance. | function getParentInstance(inst) {
return getParent(inst);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isAncestor(instA, instB) {\n\t !('_nativeNode' in instA) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : invariant(false) : void 0;\n\t !('_nativeNode' in instB) ? process.env.NODE_ENV !== 'production' ? invariant(false, 'isAncestor: Invalid argument.') : in... | [
"0.7309921",
"0.7309921",
"0.7309921",
"0.73099107",
"0.73099107",
"0.73099107",
"0.73099107",
"0.73099107",
"0.73099107",
"0.73099107",
"0.73099107",
"0.73099107",
"0.73070306",
"0.73039186",
"0.73039186",
"0.73039186",
"0.71653056",
"0.70357543",
"0.70357543",
"0.7020314",
... | 0.0 | -1 |
Simulates the traversal of a twophase, capture/bubble event dispatch. | function traverseTwoPhase(inst, fn, arg) {
var path = [];
while (inst) {
path.push(inst);
inst = getParent(inst);
}
var i = void 0;
for (i = path.length; i-- > 0;) {
fn(path[i], 'captured', arg);
}
for (i = 0; i < path.length; i++) {
fn(path[i], 'bubbled', arg);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent(inst);}var i;for(i=path.length;i-->0;){fn(path[i],'captured',arg);}for(i=0;i<path.length;i++){fn(path[i],'bubbled',arg);}}",
"function traverseTwoPhase(inst,fn,arg){var path=[];while(inst){path.push(inst);inst=getParent... | [
"0.58791095",
"0.58791095",
"0.58791095",
"0.58791095",
"0.58791095",
"0.58791095",
"0.5860188",
"0.58587825",
"0.58587825",
"0.58587825",
"0.58587825",
"0.5663513",
"0.5630192",
"0.5587722",
"0.5569497",
"0.5569497",
"0.5562592",
"0.5548963",
"0.5548963",
"0.5548963",
"0.554... | 0.0 | -1 |
Traverses the ID hierarchy and invokes the supplied `cb` on any IDs that should would receive a `mouseEnter` or `mouseLeave` event. Does not invoke the callback on the nearest common ancestor because nothing "entered" or "left" that element. | function traverseEnterLeave(from, to, fn, argFrom, argTo) {
var common = from && to ? getLowestCommonAncestor(from, to) : null;
var pathFrom = [];
while (true) {
if (!from) {
break;
}
if (from === common) {
break;
}
var alternate = from.alternate;
if (alternate !== null && alternate === common) {
break;
}
pathFrom.push(from);
from = getParent(from);
}
var pathTo = [];
while (true) {
if (!to) {
break;
}
if (to === common) {
break;
}
var _alternate = to.alternate;
if (_alternate !== null && _alternate === common) {
break;
}
pathTo.push(to);
to = getParent(to);
}
for (var i = 0; i < pathFrom.length; i++) {
fn(pathFrom[i], 'bubbled', argFrom);
}
for (var _i = pathTo.length; _i-- > 0;) {
fn(pathTo[_i], 'captured', argTo);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"_handleMouseEnter() {\n this._hovered.next(this);\n }",
"_elementMouseEnterHandler() {\n const that = this;\n\n if (that.clickMode === 'hover' && !that.disabled && !that.readonly) {\n that._handleMouseInteraction();\n }\n }",
"_elementMouseEnterHandler() {\n ... | [
"0.50938433",
"0.49230218",
"0.49230218",
"0.48820615",
"0.48795786",
"0.48795786",
"0.48697004",
"0.48644733",
"0.4798072",
"0.4776119",
"0.4734976",
"0.4734976",
"0.4734976",
"0.4734976",
"0.4734976",
"0.4734976",
"0.4734976",
"0.4734976",
"0.4734976",
"0.4734976",
"0.47289... | 0.0 | -1 |
Some event types have a notion of different registration names for different "phases" of propagation. This finds listeners by a given phase. | function listenerAtPhase(inst, event, propagationPhase) {
var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];
return getListener(inst, registrationName);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function listenerAtPhase(inst, event, propagationPhase) {\n\t\t var registrationName = event.dispatchConfig.phasedRegistrationNames[propagationPhase];\n\t\t return getListener(inst, registrationName);\n\t\t}",
"function listenerAtPhase(inst, event, propagationPhase) {\n\t\t var registrationName = event.dispat... | [
"0.6933484",
"0.6933484",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6932607",
"0.6926106",
"0.6926106",
"0.6901754",
"0.6901754",
"0.6901754",
"0.6901754",
"... | 0.0 | -1 |
A small set of propagation patterns, each of which will accept a small amount of information, and generate a set of "dispatch ready event objects" which are sets of events that have already been annotated with a set of dispatched listener functions/ids. The API is designed this way to discourage these propagation strategies from actually executing the dispatches, since we always want to collect the entire set of dispatches before executing even a single one. Tags a `SyntheticEvent` with dispatched listeners. Creating this function here, allows us to not have to bind or create functions for each event. Mutating the event's members allows us to not have to create a wrapping "dispatch" object that pairs the event with the listener. | function accumulateDirectionalDispatches(inst, phase, event) {
{
!inst ? warning(false, 'Dispatching inst must not be null') : void 0;
}
var listener = listenerAtPhase(inst, event, phase);
if (listener) {
event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);
event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function accumulateDirectionalDispatches(inst,upwards,event){if(process.env.NODE_ENV!=='production'){process.env.NODE_ENV!=='production'?warning(inst,'Dispatching inst must not be null'):void 0;}var phase=upwards?PropagationPhases.bubbled:PropagationPhases.captured;var listener=listenerAtPhase(inst,event,phase);if... | [
"0.6350786",
"0.6350786",
"0.6247749",
"0.62328684",
"0.60861367",
"0.60861367",
"0.60861367",
"0.60861367",
"0.60861367",
"0.5958953",
"0.5958953",
"0.5952106",
"0.5944571",
"0.5944571",
"0.5927643",
"0.5927643",
"0.59275264",
"0.59275264",
"0.59275264",
"0.59275264",
"0.592... | 0.0 | -1 |
Collect dispatches (must be entirely collected before dispatching see unit tests). Lazily allocate the array to conserve memory. We must loop through each event and perform the traversal for each one. We cannot perform a single traversal for the entire collection of events because each event may have a different target. | function accumulateTwoPhaseDispatchesSingle(event) {
if (event && event.dispatchConfig.phasedRegistrationNames) {
traverseTwoPhase(event._targetInst, accumulateDirectionalDispatches, event);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function executeDispatchesInOrder(event){var dispatchListeners=event._dispatchListeners;var dispatchInstances=event._dispatchInstances;{validateEventDispatches(event);}if(Array.isArray(dispatchListeners)){for(var i=0;i<dispatchListeners.length;i++){if(event.isPropagationStopped()){break;}// Listeners and Instances... | [
"0.60375905",
"0.60375905",
"0.60375905",
"0.60375905",
"0.60375905",
"0.59032416",
"0.58940375",
"0.58940375",
"0.58940375",
"0.58940375",
"0.5876829",
"0.5833313",
"0.5833313",
"0.5833313",
"0.5833313",
"0.5833313",
"0.5833313",
"0.5833313",
"0.5833313",
"0.5833313",
"0.579... | 0.0 | -1 |
Same as `accumulateTwoPhaseDispatchesSingle`, but skips over the targetID. | function accumulateTwoPhaseDispatchesSingleSkipTarget(event) {
if (event && event.dispatchConfig.phasedRegistrationNames) {
var targetInst = event._targetInst;
var parentInst = targetInst ? getParentInstance(targetInst) : null;
traverseTwoPhase(parentInst, accumulateDirectionalDispatches, event);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function accumulateTwoPhaseDispatchesSingleSkipTarget(event){if(event&&event.dispatchConfig.phasedRegistrationNames){var targetInst=event._targetInst;var parentInst=targetInst?getParentInstance(targetInst):null;traverseTwoPhase(parentInst,accumulateDirectionalDispatches,event);}}",
"function accumulateTwoPhaseDi... | [
"0.7413974",
"0.7413974",
"0.7413974",
"0.7413974",
"0.7413974",
"0.7403243",
"0.7403243",
"0.7403243",
"0.737805",
"0.7365441",
"0.7320921",
"0.7320921",
"0.73002684",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.72855204",
"0.728552... | 0.7298637 | 59 |
Accumulates without regard to direction, does not look for phased registration names. Same as `accumulateDirectDispatchesSingle` but without requiring that the `dispatchMarker` be the same as the dispatched ID. | function accumulateDispatches(inst, ignoredDirection, event) {
if (inst && event && event.dispatchConfig.registrationName) {
var registrationName = event.dispatchConfig.registrationName;
var listener = getListener(inst, registrationName);
if (listener) {
event._dispatchListeners = accumulateInto(event._dispatchListeners, listener);
event._dispatchInstances = accumulateInto(event._dispatchInstances, inst);
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function accumulateDispatches(id, ignoredDirection, event) {\n\t if (event && event.dispatchConfig.registrationName) {\n\t var registrationName = event.dispatchConfig.registrationName;\n\t var listener = getListener(id, registrationName);\n\t if (listener) {\n\t event._dispatchListeners = accumulate... | [
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745",
"0.74662745"... | 0.0 | -1 |
Do not uses the below two methods directly! Instead use constants exported from DOMTopLevelEventTypes in ReactDOM. (It is the only module that is allowed to access these methods.) | function unsafeCastStringToDOMTopLevelType(topLevelType) {
return topLevelType;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,targetInst,nativeEvent,nativeEventTarget);runEventQueueInBatch(events);}",
"function handleTopLevel(topLevelType,targetInst,nativeEvent,nativeEventTarget){var events=extractEvents(topLevelType,tar... | [
"0.6449749",
"0.6449749",
"0.6449749",
"0.63349396",
"0.6323711",
"0.62636024",
"0.622248",
"0.6149773",
"0.6149773",
"0.6149773",
"0.6149773",
"0.6149773",
"0.60983765",
"0.60983765",
"0.6082075",
"0.59561354",
"0.59380305",
"0.58962786",
"0.58962786",
"0.58962786",
"0.58962... | 0.0 | -1 |
Return whether a native keypress event is assumed to be a command. This is required because Firefox fires `keypress` events for key commands (cut, copy, selectall, etc.) even though no character is inserted. | function isKeypressCommand(nativeEvent) {
return (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&
// ctrlKey && altKey is equivalent to AltGr, and is not a command.
!(nativeEvent.ctrlKey && nativeEvent.altKey);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isKeypressCommand(nativeEvent) {\n\t return (\n\t (nativeEvent.ctrlKey || nativeEvent.altKey || nativeEvent.metaKey) &&\n\t // ctrlKey && altKey is equivalent to AltGr, and is not a command.\n\t !(nativeEvent.ctrlKey && nativeEvent.altKey)\n\t );\n\t}",
"function isKeypressCommand(nativeEvent... | [
"0.80167186",
"0.80167186",
"0.80167186",
"0.80167186",
"0.80167186",
"0.80167186",
"0.80167186",
"0.80083644",
"0.79994756",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998482",
"0.7998... | 0.0 | -1 |
This function can only be called with a workinprogress fiber and only during begin or complete phase. Do not call it under any other circumstances. | function getStackAddendumByWorkInProgressFiber(workInProgress) {
var info = '';
var node = workInProgress;
do {
info += describeFiber(node);
// Otherwise this return pointer might point to the wrong tree:
node = node.return;
} while (node);
return info;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"if (\n workInProgressSuspendedReason === SuspendedOnData &&\n workInProgressRoot === root\n ) {\n // Mark the root as ready to continue rendering.\n workInProgressSuspendedReason = SuspendedAndReadyToContinue;\n }",
"function g... | [
"0.6055185",
"0.6040343",
"0.59954184",
"0.59954184",
"0.59954184",
"0.58810025",
"0.58022887",
"0.57078326",
"0.56556517",
"0.56357723",
"0.5588384",
"0.5558378",
"0.5517867",
"0.55155945",
"0.551355",
"0.54839903",
"0.54772514",
"0.544112",
"0.544112",
"0.544112",
"0.544112... | 0.5390318 | 76 |
Get the value for a property on a node. Only used in DEV for SSR validation. The "expected" argument is used as a hint of what the expected value is. Some properties have multiple equivalent values. | function getValueForProperty(node, name, expected, propertyInfo) {
{
if (propertyInfo.mustUseProperty) {
var propertyName = propertyInfo.propertyName;
return node[propertyName];
} else {
var attributeName = propertyInfo.attributeName;
var stringValue = null;
if (propertyInfo.type === OVERLOADED_BOOLEAN) {
if (node.hasAttribute(attributeName)) {
var value = node.getAttribute(attributeName);
if (value === '') {
return true;
}
if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
return value;
}
if (value === '' + expected) {
return expected;
}
return value;
}
} else if (node.hasAttribute(attributeName)) {
if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
// We had an attribute but shouldn't have had one, so read it
// for the error message.
return node.getAttribute(attributeName);
}
if (propertyInfo.type === BOOLEAN) {
// If this was a boolean, it doesn't matter what the value is
// the fact that we have it is the same as the expected.
return expected;
}
// Even if this property uses a namespace we use getAttribute
// because we assume its namespaced name is the same as our config.
// To use getAttributeNS we need the local name which we don't have
// in our config atm.
stringValue = node.getAttribute(attributeName);
}
if (shouldRemoveAttribute(name, expected, propertyInfo, false)) {
return stringValue === null ? expected : stringValue;
} else if (stringValue === '' + expected) {
return expected;
} else {
return stringValue;
}
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getValueForProperty(node,name,expected){{var propertyInfo=getPropertyInfo(name);if(propertyInfo){var mutationMethod=propertyInfo.mutationMethod;if(mutationMethod||propertyInfo.mustUseProperty){return node[propertyInfo.propertyName];}else{var attributeName=propertyInfo.attributeName;var stringValue=null;if... | [
"0.81597364",
"0.81597364",
"0.8144743",
"0.8068788",
"0.8068788",
"0.80650955",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
"0.80606514",
... | 0.0 | -1 |
Get the value for a attribute on a node. Only used in DEV for SSR validation. The third argument is used as a hint of what the expected value is. Some attributes have multiple equivalent values. | function getValueForAttribute(node, name, expected) {
{
if (!isAttributeNameSafe(name)) {
return;
}
if (!node.hasAttribute(name)) {
return expected === undefined ? undefined : null;
}
var value = node.getAttribute(name);
if (value === '' + expected) {
return expected;
}
return value;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getValueForAttribute(node,name,expected){{if(!isAttributeNameSafe(name)){return;}if(!node.hasAttribute(name)){return expected===undefined?undefined:null;}var value=node.getAttribute(name);if(value===''+expected){return expected;}return value;}}",
"function getValueForAttribute(node,name,expected){{if(!i... | [
"0.7426042",
"0.7426042",
"0.7426042",
"0.7426042",
"0.7426042",
"0.7426042",
"0.7426042",
"0.7426042",
"0.7426042",
"0.7426042",
"0.73294044",
"0.73294044",
"0.73260397",
"0.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
"0.7322676",
... | 0.0 | -1 |
Implements an host component that allows setting these optional props: `checked`, `value`, `defaultChecked`, and `defaultValue`. If `checked` or `value` are not supplied (or null/undefined), user actions that affect the checked state or value will trigger updates to the element. If they are supplied (and not null/undefined), the rendered element will not trigger updates to the element. Instead, the props must change in order for the rendered element to be updated. The rendered element will be initialized as unchecked (or `defaultChecked`) with an empty value (or `defaultValue`). See | function getHostProps(element, props) {
var node = element;
var checked = props.checked;
var hostProps = _assign({}, props, {
defaultChecked: undefined,
defaultValue: undefined,
value: undefined,
checked: checked != null ? checked : node._wrapperState.initialChecked
});
return hostProps;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"constructor(props) {\n super(props);\n this.value = props.value;\n this.id = RadioButton.idGenerator(this.value);\n this.groupName = props.groupName;\n this.optional = {};\n if (typeof props.onChangeCallback === 'function') {\n this.optional.onChangeCallback =\n... | [
"0.6890673",
"0.6785545",
"0.6785545",
"0.6785545",
"0.6785545",
"0.6785545",
"0.6785545",
"0.6785545",
"0.6785545",
"0.6785545",
"0.63877356",
"0.62561625",
"0.6210559",
"0.6131126",
"0.6131126",
"0.6131126",
"0.6131126",
"0.6131126",
"0.6131126",
"0.6131126",
"0.6131126",
... | 0.0 | -1 |
In Chrome, assigning defaultValue to certain input types triggers input validation. For number inputs, the display value loses trailing decimal points. For email inputs, Chrome raises "The specified value is not a valid email address". Here we check to see if the defaultValue has actually changed, avoiding these problems when the user is inputting text | function setDefaultValue(node, type, value) {
if (
// Focused number inputs synchronize on blur. See ChangeEventPlugin.js
type !== 'number' || node.ownerDocument.activeElement !== node) {
if (value == null) {
node.defaultValue = '' + node._wrapperState.initialValue;
} else if (node.defaultValue !== '' + value) {
node.defaultValue = '' + value;
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"shouldSetInputTextToDefaultValue (props) {\n let result = (this.previousDefaultValue != props.defaultValue) || (this.previousChangeIndicator != props.changeIndicator)\n return result\n }",
"function checkValue(value, defaultValue) {\n return (value ? value : defaultValue)\n }",
"function setDe... | [
"0.7002995",
"0.66457564",
"0.65495944",
"0.65495944",
"0.6510807",
"0.6510807",
"0.65021855",
"0.65021855",
"0.65021855",
"0.65021855",
"0.65021855",
"0.6381883",
"0.6381883",
"0.6381883",
"0.6381883",
"0.6381883",
"0.6381883",
"0.6381883",
"0.6381883",
"0.6381883",
"0.63741... | 0.0 | -1 |
SECTION: handle `change` event | function shouldUseChangeEvent(elem) {
var nodeName = elem.nodeName && elem.nodeName.toLowerCase();
return nodeName === 'select' || nodeName === 'input' && elem.type === 'file';
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"change(/*event*/) {\n this._super(...arguments);\n this._parse();\n }",
"handleChange(event) {\n this.dispatchEvent(new CustomEvent('change', {detail: event.target.value}));\n }",
"onchange() {}",
"function onChange() {\n\t\t__debug_452( 'Received a change event.' );\n\t\tself.render();\n\t}... | [
"0.7854437",
"0.77068484",
"0.7598262",
"0.7521723",
"0.7511005",
"0.7504069",
"0.7448793",
"0.7420877",
"0.7401912",
"0.7386296",
"0.73666596",
"0.73555636",
"0.73510677",
"0.73496395",
"0.73438835",
"0.7339759",
"0.73381084",
"0.73354316",
"0.73326874",
"0.7328343",
"0.7321... | 0.0 | -1 |
(For IE <=9) Starts tracking propertychange events on the passedin element and override the value property so that we can distinguish user events from value changes in JS. | function startWatchingForValueChange(target, targetInst) {
activeElement = target;
activeElementInst = targetInst;
activeElement.attachEvent('onpropertychange', handlePropertyChange);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('on... | [
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.74985516",
"0.7280844",
"0.7193671",
"0.7193671",
"0.70448834",
"0.7032214",
"0.70233506",
"0.6934341",
"0.6934341",
"0... | 0.0 | -1 |
(For IE <=9) Removes the event listeners from the currentlytracked element, if any exists. | function stopWatchingForValueChange() {
if (!activeElement) {
return;
}
activeElement.detachEvent('onpropertychange', handlePropertyChange);
activeElement = null;
activeElementInst = null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"_removeEventListeners() {\n this.currentEventListeners.forEach(listener => {\n this.domElement.removeEventListener(listener.event, listener.callBack);\n });\n this.currentEventListeners = null;\n }",
"function removeListeners(useCapturing) {\r\r\n // get all div in list\r\r\... | [
"0.75100756",
"0.7134596",
"0.710348",
"0.70854056",
"0.70854056",
"0.70752424",
"0.705488",
"0.7043779",
"0.70388514",
"0.7013583",
"0.7004919",
"0.6984396",
"0.6976549",
"0.69420594",
"0.6922267",
"0.6918258",
"0.6913697",
"0.6898917",
"0.6863952",
"0.6862534",
"0.6861944",... | 0.0 | -1 |
(For IE <=9) Handles a propertychange event, sending a `change` event if the value of the active element has changed. | function handlePropertyChange(nativeEvent) {
if (nativeEvent.propertyName !== 'value') {
return;
}
if (getInstIfValueChanged(activeElementInst)) {
manualDispatchChangeEvent(nativeEvent);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('onpropertychange',handlePropertyChange);}",
"function startWatchingForValueChange(target,targetInst){activeElement=target;activeElementInst=targetInst;activeElement.attachEvent('on... | [
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.7171032",
"0.6944243",
"0.6842561",
"0.68339026",
"0.6746077",
"0.6695916",
"0.6695916",
"0.6695916",
"0.6695916",
"0.6695916",
... | 0.0 | -1 |
For IE8 and IE9. | function getTargetInstForInputEventPolyfill(topLevelType, targetInst) {
if (topLevelType === TOP_SELECTION_CHANGE || topLevelType === TOP_KEY_UP || topLevelType === TOP_KEY_DOWN) {
// On the selectionchange event, the target is just document which isn't
// helpful for us so just check activeElement instead.
//
// 99% of the time, keydown and keyup aren't necessary. IE8 fails to fire
// propertychange on the first input event after setting `value` from a
// script and fires only keydown, keypress, keyup. Catching keyup usually
// gets it and catching keydown lets us fire an event for the first
// keystroke if user does a key repeat (it'll be a little delayed: right
// before the second keystroke). Other input methods (e.g., paste) seem to
// fire selectionchange normally.
return getInstIfValueChanged(activeElementInst);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function isLowIE9() {\r\n var e = window.navigator.userAgent.toString().toUpperCase();\r\n var flag = false;\r\n if (e.indexOf(\"MSIE\") >= 0) {\r\n\r\n if (e.indexOf(\"MSIE 6.0\") > 0) flag = true;\r\n if (e.indexOf(\"MSIE 7.0\") > 0) flag = true;\r\n if (e.in... | [
"0.71892583",
"0.7018611",
"0.6990977",
"0.6990977",
"0.67857254",
"0.6689359",
"0.65084034",
"0.64540815",
"0.64540815",
"0.6431494",
"0.6362608",
"0.63479495",
"0.62849253",
"0.6247649",
"0.6229919",
"0.6197086",
"0.61709774",
"0.6158672",
"0.61451566",
"0.61313784",
"0.611... | 0.0 | -1 |
SECTION: handle `click` event | function shouldUseClickEvent(elem) {
// Use the `click` event to detect changes to checkbox and radio inputs.
// This approach works across all browsers, whereas `change` does not fire
// until `blur` in IE8.
var nodeName = elem.nodeName;
return nodeName && nodeName.toLowerCase() === 'input' && (elem.type === 'checkbox' || elem.type === 'radio');
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"handleClick( event ){ }",
"handleClick() {}",
"function handleClick(){\n console.log(\"clicked\");\n}",
"function handleClick(event)\n{\n}",
"click() { }",
"function clickHandler(){\n console.log('I am clicked');\n}",
"function clickHandler(event) {\n\tindexChangeSections(event);\n\ttabChangeSect... | [
"0.8123866",
"0.7879277",
"0.7531671",
"0.7500634",
"0.7475805",
"0.7402668",
"0.73915786",
"0.7379595",
"0.7379595",
"0.7331232",
"0.7330436",
"0.7245654",
"0.72390676",
"0.72122186",
"0.7116352",
"0.7082111",
"0.7062615",
"0.7056091",
"0.7017624",
"0.7006748",
"0.6982211",
... | 0.0 | -1 |
IE8 does not implement getModifierState so we simply map it to the only modifier keys exposed by the event itself, does not support Lockkeys. Currently, all major browsers except Chrome seems to support Lockkeys. | function modifierStateGetter(keyArg) {
var syntheticEvent = this;
var nativeEvent = syntheticEvent.nativeEvent;
if (nativeEvent.getModifierState) {
return nativeEvent.getModifierState(keyArg);
}
var keyProp = modifierKeyToProp[keyArg];
return keyProp ? !!nativeEvent[keyProp] : false;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function modifierStateGetter(keyArg){var syntheticEvent=this;var nativeEvent=syntheticEvent.nativeEvent;if(nativeEvent.getModifierState){return nativeEvent.getModifierState(keyArg);}var keyProp=modifierKeyToProp[keyArg];return keyProp?!!nativeEvent[keyProp]:false;}",
"function modifierStateGetter(keyArg){var syn... | [
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.73103",
"0.72735363",
"0.7215798",
"0.7187312",
"0.7187312",
"0.71068054",
"0.70859236",
"0.70859236",
"0.69601",
... | 0.0 | -1 |
`ReactInstanceMap` maintains a mapping from a public facing stateful instance (key) and the internal representation (value). This allows public methods to accept the user facing instance as an argument and map them back to internal methods. Note that this module is currently shared and assumed to be stateless. If this becomes an actual Map, that will break. This API should be called `delete` but we'd have to make sure to always transform these to strings for IE support. When this transform is fully supported we can rename it. | function get(key) {
return key._reactInternalFiber;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function mapWrapper(key)\n{\n\tthis.key = key;\n}",
"function Map() {\n this.container = new Object();\n}",
"function Map() {\r\n this.keys = [];\r\n this.values = [];\r\n}",
"function Map() {\n\tthis.keys = [];\n\tthis.values = [];\n\n\t// add a key / value pair to map\n\tthis.add = function(key, v... | [
"0.56226665",
"0.54416645",
"0.5437218",
"0.5427679",
"0.52922314",
"0.52269",
"0.5219736",
"0.51513004",
"0.5148289",
"0.51441056",
"0.51216936",
"0.51147085",
"0.5111892",
"0.51110727",
"0.50542724",
"0.5044242",
"0.5023131",
"0.5023131",
"0.4996279",
"0.4996279",
"0.499627... | 0.0 | -1 |
Find the deepest React component completely containing the root of the passedin instance (for use when entire React trees are nested within each other). If React trees are not nested, returns null. | function findRootContainerNode(inst) {
// TODO: It may be a good idea to cache this to prevent unnecessary DOM
// traversal, but caching is difficult to do correctly without using a
// mutation observer to listen for all DOM changes.
while (inst.return) {
inst = inst.return;
}
if (inst.tag !== HostRoot) {
// This can happen if we're in a detached tree.
return null;
}
return inst.stateNode.containerInfo;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function findFirstReactDOMImpl(node) {\n // This node might be from another React instance, so we make sure not to\n // examine the node cache here\n for (; node && node.parentNode !== node; node = node.parentNode) {\n if (node.nodeType !== 1) {\n // Not a DOMElement, therefore not a React component\n ... | [
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.68749243",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0.6796577",
"0... | 0.0 | -1 |
Used to store ancestor hierarchy in top level callback | function getTopLevelCallbackBookKeeping(topLevelType, nativeEvent, targetInst) {
if (callbackBookkeepingPool.length) {
var instance = callbackBookkeepingPool.pop();
instance.topLevelType = topLevelType;
instance.nativeEvent = nativeEvent;
instance.targetInst = targetInst;
return instance;
}
return {
topLevelType: topLevelType,
nativeEvent: nativeEvent,
targetInst: targetInst,
ancestors: []
};
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function fullAncestor(node, callback, baseVisitor, state) {\n if (!baseVisitor) { baseVisitor = base; }\n var ancestors = []\n ;(function c(node, st, override) {\n var type = override || node.type;\n var isNew = node !== ancestors[ancestors.length - 1];\n if (isNew) { ancestors.push(node); ... | [
"0.63650066",
"0.63650066",
"0.63517284",
"0.6194851",
"0.60661834",
"0.59946203",
"0.59337914",
"0.5927715",
"0.5798319",
"0.57487017",
"0.5732234",
"0.56577903",
"0.5634935",
"0.5633306",
"0.56213325",
"0.5599346",
"0.5596999",
"0.5585871",
"0.5580441",
"0.5567022",
"0.5566... | 0.0 | -1 |
Implements an host component that warns when `selected` is set. | function validateProps(element, props) {
// TODO (yungsters): Remove support for `selected` in <option>.
{
if (props.selected != null && !didWarnSelectedSetOnOption) {
warning(false, 'Use the `defaultValue` or `value` props on <select> instead of ' + 'setting `selected` on <option>.');
didWarnSelectedSetOnOption = true;
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"get _shouldUpdateSelection(){return this.selected!=null;}",
"get selected() { return this._selected; }",
"get selected() { return this._selected; }",
"get selected() { return this._selected; }",
"get selected() { return this._selected; }",
"get selected() { return this._selected; }",
"get selected() { ... | [
"0.5836068",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.57184714",
"0.5654467",
"0.55860525",
"0.5576725",
"0.55757415",
"0.5562336",
"0.5562336",
"0.55441296",
"... | 0.5188575 | 81 |
Validation function for `value` and `defaultValue`. | function checkSelectPropTypes(props) {
ReactControlledValuePropTypes.checkPropTypes('select', props, getCurrentFiberStackAddendum$3);
for (var i = 0; i < valuePropNames.length; i++) {
var propName = valuePropNames[i];
if (props[propName] == null) {
continue;
}
var isArray = Array.isArray(props[propName]);
if (props.multiple && !isArray) {
warning(false, 'The `%s` prop supplied to <select> must be an array if ' + '`multiple` is true.%s', propName, getDeclarationErrorAddendum());
} else if (!props.multiple && isArray) {
warning(false, 'The `%s` prop supplied to <select> must be a scalar ' + 'value if `multiple` is false.%s', propName, getDeclarationErrorAddendum());
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"'validateValue'(value) {}",
"function checkValue(value, defaultValue) {\n return (value ? value : defaultValue)\n }",
"function validateInput(\n value,\n { float, canBeNegative, canBeEmpty, defaultValue }\n) {\n if (`${value}`.length > 0) {\n const valueAsNumber = float ? parseFloat(value) : pa... | [
"0.7436162",
"0.6856192",
"0.65868",
"0.6431272",
"0.64279246",
"0.64279246",
"0.6416799",
"0.6416799",
"0.6416799",
"0.6316331",
"0.6230596",
"0.6195563",
"0.616348",
"0.61238676",
"0.6050824",
"0.6044303",
"0.6036909",
"0.59743184",
"0.59359854",
"0.58691984",
"0.58653325",... | 0.0 | -1 |
Implements a host component that allows optionally setting the props `value` and `defaultValue`. If `multiple` is false, the prop must be a stringable. If `multiple` is true, the prop must be an array of stringables. If `value` is not supplied (or null/undefined), user actions that change the selected option will trigger updates to the rendered options. If it is supplied (and not null/undefined), the rendered options will not update in response to user actions. Instead, the `value` prop must change in order for the rendered options to update. If `defaultValue` is provided, any options with the supplied values will be selected. | function getHostProps$2(element, props) {
return _assign({}, props, {
value: undefined
});
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function selectValueType(props,propName,componentName){if(props[propName]==null){return null;}if(props.multiple){if(!Array.isArray(props[propName])){return new Error(\"The `\"+propName+\"` prop supplied to <select> must be an array if \"+\"`multiple` is true.\");}}else {if(Array.isArray(props[propName])){return ne... | [
"0.6098947",
"0.60637647",
"0.58246845",
"0.58246845",
"0.5734163",
"0.57121176",
"0.57060874",
"0.57060874",
"0.57060874",
"0.57060874",
"0.57060874",
"0.5686245",
"0.5681213",
"0.56413835",
"0.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
"0.56330454",
... | 0.0 | -1 |
Implements a host component that allows setting `value`, and `defaultValue`. This differs from the traditional DOM API because value is usually set as PCDATA children. If `value` is not supplied (or null/undefined), user actions that affect the value will trigger updates to the element. If `value` is supplied (and not null/undefined), the rendered element will not trigger updates to the element. Instead, the `value` prop must change in order for the rendered element to be updated. The rendered element will be initialized with an empty value, the prop `defaultValue` if specified, or the children content (deprecated). | function getHostProps$3(element, props) {
var node = element;
!(props.dangerouslySetInnerHTML == null) ? invariant(false, '`dangerouslySetInnerHTML` does not make sense on <textarea>.') : void 0;
// Always set children to the same thing. In IE9, the selection range will
// get reset if `textContent` is mutated. We could add a check in setTextContent
// to only set the value if/when the value differs from the node value (which would
// completely solve this IE9 bug), but Sebastian+Sophie seemed to like this
// solution. The value can be a boolean or object so that's why it's forced
// to be a string.
var hostProps = _assign({}, props, {
value: undefined,
defaultValue: undefined,
children: '' + node._wrapperState.initialValue
});
return hostProps;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"set value(val) {\n if (this.#el) this.#el.value = val;\n else this.#value = val;\n }",
"setValue(value){\n const thisWidget = this;\n const newValue = thisWidget.parseValue(value);\n \n /* TODO: Add validation */\n if(newValue !=thisWidget.value && thisWidget.isValid(newValue)){\n this... | [
"0.64194894",
"0.5993452",
"0.59779125",
"0.59779125",
"0.59779125",
"0.59779125",
"0.59779125",
"0.59779125",
"0.59779125",
"0.5952545",
"0.5928599",
"0.5900086",
"0.5880415",
"0.5880415",
"0.5880415",
"0.5880415",
"0.5880415",
"0.5880415",
"0.5880415",
"0.5823071",
"0.57661... | 0.0 | -1 |
Assumes there is no parent namespace. | function getIntrinsicNamespace(type) {
switch (type) {
case 'svg':
return SVG_NAMESPACE;
case 'math':
return MATH_NAMESPACE;
default:
return HTML_NAMESPACE$1;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function getParentObject(){\r\n var obj = parent;\r\n if (namespace !== \"\") {\r\n for (var i = 0, ii = namespace.split(\".\"); i < ii.length; i++) {\r\n obj = obj[ii[i]];\r\n }\r\n }\r\n return obj.easyXDM;\r\n}",
"function namespaceHTMLInternal() {\n instructionState.lF... | [
"0.59294087",
"0.5788852",
"0.5788852",
"0.5788852",
"0.5788852",
"0.5788852",
"0.5788852",
"0.57438385",
"0.56890935",
"0.5673484",
"0.56610936",
"0.5640146",
"0.5580239",
"0.544239",
"0.5442175",
"0.5410278",
"0.5397606",
"0.53690296",
"0.53592485",
"0.5327534",
"0.532705",... | 0.0 | -1 |
Operations for dealing with CSS properties. This creates a string that is expected to be equivalent to the style attribute generated by serverside rendering. It bypasses warnings and security checks so it's not safe to use this value for anything other than comparison. It is only used in DEV for SSR validation. | function createDangerousStringForStyles(styles) {
{
var serialized = '';
var delimiter = '';
for (var styleName in styles) {
if (!styles.hasOwnProperty(styleName)) {
continue;
}
var styleValue = styles[styleName];
if (styleValue != null) {
var isCustomProperty = styleName.indexOf('--') === 0;
serialized += delimiter + hyphenateStyleName(styleName) + ':';
serialized += dangerousStyleValue(styleName, styleValue, isCustomProperty);
delimiter = ';';
}
}
return serialized || null;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static get styles () {\n return css`${unsafeCSS(style)}`\n }",
"get cssText() {\n var properties = [];\n for (var i = 0, length = this.length; i < length; ++i) {\n var name = this[i];\n var value = this.getPropertyValue(name);\n var priority = this.getPropertyPriority(name);\n if (p... | [
"0.67464244",
"0.661183",
"0.6600644",
"0.65224516",
"0.65224516",
"0.64343566",
"0.64050084",
"0.6367678",
"0.6296773",
"0.61987394",
"0.6183087",
"0.617019",
"0.617019",
"0.61692977",
"0.6166631",
"0.61150366",
"0.6076142",
"0.6076142",
"0.60742265",
"0.60742265",
"0.607422... | 0.0 | -1 |
Calculate the diff between the two objects. | function diffProperties$1(domElement, tag, lastRawProps, nextRawProps, rootContainerElement) {
{
validatePropertiesInDevelopment(tag, nextRawProps);
}
var updatePayload = null;
var lastProps = void 0;
var nextProps = void 0;
switch (tag) {
case 'input':
lastProps = getHostProps(domElement, lastRawProps);
nextProps = getHostProps(domElement, nextRawProps);
updatePayload = [];
break;
case 'option':
lastProps = getHostProps$1(domElement, lastRawProps);
nextProps = getHostProps$1(domElement, nextRawProps);
updatePayload = [];
break;
case 'select':
lastProps = getHostProps$2(domElement, lastRawProps);
nextProps = getHostProps$2(domElement, nextRawProps);
updatePayload = [];
break;
case 'textarea':
lastProps = getHostProps$3(domElement, lastRawProps);
nextProps = getHostProps$3(domElement, nextRawProps);
updatePayload = [];
break;
default:
lastProps = lastRawProps;
nextProps = nextRawProps;
if (typeof lastProps.onClick !== 'function' && typeof nextProps.onClick === 'function') {
// TODO: This cast may not be sound for SVG, MathML or custom elements.
trapClickOnNonInteractiveElement(domElement);
}
break;
}
assertValidProps(tag, nextProps, getStack);
var propKey = void 0;
var styleName = void 0;
var styleUpdates = null;
for (propKey in lastProps) {
if (nextProps.hasOwnProperty(propKey) || !lastProps.hasOwnProperty(propKey) || lastProps[propKey] == null) {
continue;
}
if (propKey === STYLE) {
var lastStyle = lastProps[propKey];
for (styleName in lastStyle) {
if (lastStyle.hasOwnProperty(styleName)) {
if (!styleUpdates) {
styleUpdates = {};
}
styleUpdates[styleName] = '';
}
}
} else if (propKey === DANGEROUSLY_SET_INNER_HTML || propKey === CHILDREN) {
// Noop. This is handled by the clear text mechanism.
} else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING$1) {
// Noop
} else if (propKey === AUTOFOCUS) {
// Noop. It doesn't work on updates anyway.
} else if (registrationNameModules.hasOwnProperty(propKey)) {
// This is a special case. If any listener updates we need to ensure
// that the "current" fiber pointer gets updated so we need a commit
// to update this element.
if (!updatePayload) {
updatePayload = [];
}
} else {
// For all other deleted properties we add it to the queue. We use
// the whitelist in the commit phase instead.
(updatePayload = updatePayload || []).push(propKey, null);
}
}
for (propKey in nextProps) {
var nextProp = nextProps[propKey];
var lastProp = lastProps != null ? lastProps[propKey] : undefined;
if (!nextProps.hasOwnProperty(propKey) || nextProp === lastProp || nextProp == null && lastProp == null) {
continue;
}
if (propKey === STYLE) {
{
if (nextProp) {
// Freeze the next style object so that we can assume it won't be
// mutated. We have already warned for this in the past.
Object.freeze(nextProp);
}
}
if (lastProp) {
// Unset styles on `lastProp` but not on `nextProp`.
for (styleName in lastProp) {
if (lastProp.hasOwnProperty(styleName) && (!nextProp || !nextProp.hasOwnProperty(styleName))) {
if (!styleUpdates) {
styleUpdates = {};
}
styleUpdates[styleName] = '';
}
}
// Update styles that changed since `lastProp`.
for (styleName in nextProp) {
if (nextProp.hasOwnProperty(styleName) && lastProp[styleName] !== nextProp[styleName]) {
if (!styleUpdates) {
styleUpdates = {};
}
styleUpdates[styleName] = nextProp[styleName];
}
}
} else {
// Relies on `updateStylesByID` not mutating `styleUpdates`.
if (!styleUpdates) {
if (!updatePayload) {
updatePayload = [];
}
updatePayload.push(propKey, styleUpdates);
}
styleUpdates = nextProp;
}
} else if (propKey === DANGEROUSLY_SET_INNER_HTML) {
var nextHtml = nextProp ? nextProp[HTML] : undefined;
var lastHtml = lastProp ? lastProp[HTML] : undefined;
if (nextHtml != null) {
if (lastHtml !== nextHtml) {
(updatePayload = updatePayload || []).push(propKey, '' + nextHtml);
}
} else {
// TODO: It might be too late to clear this if we have children
// inserted already.
}
} else if (propKey === CHILDREN) {
if (lastProp !== nextProp && (typeof nextProp === 'string' || typeof nextProp === 'number')) {
(updatePayload = updatePayload || []).push(propKey, '' + nextProp);
}
} else if (propKey === SUPPRESS_CONTENT_EDITABLE_WARNING || propKey === SUPPRESS_HYDRATION_WARNING$1) {
// Noop
} else if (registrationNameModules.hasOwnProperty(propKey)) {
if (nextProp != null) {
// We eagerly listen to this even though we haven't committed yet.
if (true && typeof nextProp !== 'function') {
warnForInvalidEventListener(propKey, nextProp);
}
ensureListeningTo(rootContainerElement, propKey);
}
if (!updatePayload && lastProp !== nextProp) {
// This is a special case. If any listener updates we need to ensure
// that the "current" props pointer gets updated so we need a commit
// to update this element.
updatePayload = [];
}
} else {
// For any other property we always add it to the queue and then we
// filter it out using the whitelist during the commit.
(updatePayload = updatePayload || []).push(propKey, nextProp);
}
}
if (styleUpdates) {
(updatePayload = updatePayload || []).push(STYLE, styleUpdates);
}
return updatePayload;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function diff(v1, v2) {\n return {\n x: v1.x - v2.x,\n y: v1.y - v2.y\n };\n}",
"function diff(a, b) {\n totalDifference += Math.abs(a - b);\n }",
"getDifference(other) {\n return {\n xDiff: other.x - this.x,\n yDiff: other.y - this.y,\n };\n }",
"functi... | [
"0.73584795",
"0.70092916",
"0.6960951",
"0.6865758",
"0.6865758",
"0.6865758",
"0.6865758",
"0.6865758",
"0.6865758",
"0.66720665",
"0.6600449",
"0.65714246",
"0.65645313",
"0.6558132",
"0.65098464",
"0.6492369",
"0.6446226",
"0.6443762",
"0.6413908",
"0.6397446",
"0.6332192... | 0.0 | -1 |
Renderers that don't support persistence can reexport everything from this module. | function shim() {
invariant(false, 'The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.');
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function shim(){invariant(false,'The current renderer does not support persistence. This error is likely caused by a bug in React. Please file an issue.');}// Persistence (when unsupported)",
"function shim(){invariant(false,'The current renderer does not support persistence. This error is likely caused by a bug... | [
"0.627087",
"0.627087",
"0.627087",
"0.627087",
"0.6055511",
"0.6055511",
"0.6055511",
"0.6019565",
"0.6019565",
"0.6019565",
"0.6019565",
"0.5889982",
"0.5829564",
"0.5828152",
"0.5709535",
"0.5709535",
"0.56598616",
"0.5428593",
"0.5428593",
"0.5421229",
"0.5421229",
"0.5... | 0.55839 | 54 |
1 unit of expiration time represents 10ms. | function msToExpirationTime(ms) {
// Always add an offset so that we don't clash with the magic number for NoWork.
return (ms / UNIT_SIZE | 0) + MAGIC_NUMBER_OFFSET;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_OFFSET;}",
"function msToExpirationTime(ms){// Always add an offset so that we don't clash with the magic number for NoWork.\nreturn(ms/UNIT_SIZE|0)+MAGIC_NUMBER_O... | [
"0.69083685",
"0.69083685",
"0.69083685",
"0.69083685",
"0.68177795",
"0.68177795",
"0.68177795",
"0.6728504",
"0.66832036",
"0.66832036",
"0.66832036",
"0.6663674",
"0.66431606",
"0.66385615",
"0.65983444",
"0.65983444",
"0.65983444",
"0.6567885",
"0.65556103",
"0.65173113",
... | 0.6494671 | 67 |
This is used to create an alternate fiber to do work on. | function createWorkInProgress(current, pendingProps, expirationTime) {
var workInProgress = current.alternate;
if (workInProgress === null) {
// We use a double buffering pooling technique because we know that we'll
// only ever need at most two versions of a tree. We pool the "other" unused
// node that we're free to reuse. This is lazily created to avoid allocating
// extra objects for things that are never updated. It also allow us to
// reclaim the extra memory if needed.
workInProgress = createFiber(current.tag, pendingProps, current.key, current.mode);
workInProgress.type = current.type;
workInProgress.stateNode = current.stateNode;
{
// DEV-only fields
workInProgress._debugID = current._debugID;
workInProgress._debugSource = current._debugSource;
workInProgress._debugOwner = current._debugOwner;
}
workInProgress.alternate = current;
current.alternate = workInProgress;
} else {
workInProgress.pendingProps = pendingProps;
// We already have an alternate.
// Reset the effect tag.
workInProgress.effectTag = NoEffect;
// The effect list is no longer valid.
workInProgress.nextEffect = null;
workInProgress.firstEffect = null;
workInProgress.lastEffect = null;
if (enableProfilerTimer) {
// We intentionally reset, rather than copy, actualDuration & actualStartTime.
// This prevents time from endlessly accumulating in new commits.
// This has the downside of resetting values for different priority renders,
// But works for yielding (the common case) and should support resuming.
workInProgress.actualDuration = 0;
workInProgress.actualStartTime = 0;
}
}
workInProgress.expirationTime = expirationTime;
workInProgress.child = current.child;
workInProgress.memoizedProps = current.memoizedProps;
workInProgress.memoizedState = current.memoizedState;
workInProgress.updateQueue = current.updateQueue;
// These will be overridden during the parent's reconciliation
workInProgress.sibling = current.sibling;
workInProgress.index = current.index;
workInProgress.ref = current.ref;
if (enableProfilerTimer) {
workInProgress.selfBaseTime = current.selfBaseTime;
workInProgress.treeBaseTime = current.treeBaseTime;
}
return workInProgress;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"createFiber(func) {\n return this.createLaxFiber.apply(this, __arguments.withContext(this.LAX_EMPTY_CONTEXT, arguments));\n }",
"function createWorkInProgress(current, pendingProps, expirationTime) {\n var workInProgress = current.alternate;\n if (workInProgress === null) {\n // We use a double bu... | [
"0.619161",
"0.5820947",
"0.5820947",
"0.5820947",
"0.5820947",
"0.5820947",
"0.5820947",
"0.5820947",
"0.57810336",
"0.5733009",
"0.5643758",
"0.5643758",
"0.5643758",
"0.5643758",
"0.5643758",
"0.5643758",
"0.5643758",
"0.5643758",
"0.5643758",
"0.5643758",
"0.5643758",
"... | 0.561368 | 30 |
Used for stashing WIP properties to replay failed work in DEV. | function assignFiberPropertiesInDEV(target, source) {
if (target === null) {
// This Fiber's initial properties will always be overwritten.
// We only use a Fiber to ensure the same hidden class so DEV isn't slow.
target = createFiber(IndeterminateComponent, null, null, NoContext);
}
// This is intentionally written as a list of all properties.
// We tried to use Object.assign() instead but this is called in
// the hottest path, and Object.assign() was too slow:
// https://github.com/facebook/react/issues/12502
// This code is DEV-only so size is not a concern.
target.tag = source.tag;
target.key = source.key;
target.type = source.type;
target.stateNode = source.stateNode;
target.return = source.return;
target.child = source.child;
target.sibling = source.sibling;
target.index = source.index;
target.ref = source.ref;
target.pendingProps = source.pendingProps;
target.memoizedProps = source.memoizedProps;
target.updateQueue = source.updateQueue;
target.memoizedState = source.memoizedState;
target.mode = source.mode;
target.effectTag = source.effectTag;
target.nextEffect = source.nextEffect;
target.firstEffect = source.firstEffect;
target.lastEffect = source.lastEffect;
target.expirationTime = source.expirationTime;
target.alternate = source.alternate;
if (enableProfilerTimer) {
target.actualDuration = source.actualDuration;
target.actualStartTime = source.actualStartTime;
target.selfBaseTime = source.selfBaseTime;
target.treeBaseTime = source.treeBaseTime;
}
target._debugID = source._debugID;
target._debugSource = source._debugSource;
target._debugOwner = source._debugOwner;
target._debugIsCurrentlyTiming = source._debugIsCurrentlyTiming;
return target;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"assignFiberPropertiesInDEV(unitOfWork, originalWorkInProgressCopy);\n\n if (enableProfilerTimer && unitOfWork.mode & ProfileMode) {\n // Reset the profiler timer.\n startProfilerTimer(unitOfWork);\n }",
"function InternalBreakpointState() { }",
"function InternalBreakpointState() {}",
... | [
"0.6011011",
"0.54045147",
"0.53980833",
"0.53980833",
"0.5266002",
"0.5239496",
"0.5219925",
"0.51719093",
"0.5114947",
"0.50887054",
"0.5083666",
"0.5075196",
"0.50734526",
"0.5067331",
"0.5053954",
"0.50185883",
"0.49673146",
"0.4958323",
"0.494461",
"0.49131462",
"0.49120... | 0.0 | -1 |
TODO: This should be lifted into the renderer. | function createFiberRoot(containerInfo, isAsync, hydrate) {
// Cyclic construction. This cheats the type system right now because
// stateNode is any.
var uninitializedFiber = createHostRootFiber(isAsync);
var root = {
current: uninitializedFiber,
containerInfo: containerInfo,
pendingChildren: null,
earliestPendingTime: NoWork,
latestPendingTime: NoWork,
earliestSuspendedTime: NoWork,
latestSuspendedTime: NoWork,
latestPingedTime: NoWork,
pendingCommitExpirationTime: NoWork,
finishedWork: null,
context: null,
pendingContext: null,
hydrate: hydrate,
remainingExpirationTime: NoWork,
firstBatch: null,
nextScheduledRoot: null
};
uninitializedFiber.stateNode = root;
return root;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static rendered () {}",
"static rendered () {}",
"render() {\n // Subclasses should override\n }",
"render() {\n\n\t}",
"render() {\n\n\t}",
"function render() {\n\n\t\t\t}",
"_render() {}",
"_firstRendered() { }",
"function TextRenderer(){}// no need for block level renderers",
"function ren... | [
"0.704517",
"0.704517",
"0.69010174",
"0.6737739",
"0.6737739",
"0.6670251",
"0.6618646",
"0.6586606",
"0.6582253",
"0.6540401",
"0.65195984",
"0.6474389",
"0.64730567",
"0.64730567",
"0.64730567",
"0.64297307",
"0.64223486",
"0.63653326",
"0.63653326",
"0.63407457",
"0.63215... | 0.0 | -1 |
Invokes the mount lifecycles on a previously never rendered instance. | function mountClassInstance(workInProgress, renderExpirationTime) {
var ctor = workInProgress.type;
{
checkClassInstance(workInProgress);
}
var instance = workInProgress.stateNode;
var props = workInProgress.pendingProps;
var unmaskedContext = getUnmaskedContext(workInProgress);
instance.props = props;
instance.state = workInProgress.memoizedState;
instance.refs = emptyObject;
instance.context = getMaskedContext(workInProgress, unmaskedContext);
{
if (workInProgress.mode & StrictMode) {
ReactStrictModeWarnings.recordUnsafeLifecycleWarnings(workInProgress, instance);
ReactStrictModeWarnings.recordLegacyContextWarning(workInProgress, instance);
}
if (warnAboutDeprecatedLifecycles) {
ReactStrictModeWarnings.recordDeprecationWarnings(workInProgress, instance);
}
}
var updateQueue = workInProgress.updateQueue;
if (updateQueue !== null) {
processUpdateQueue(workInProgress, updateQueue, props, instance, renderExpirationTime);
instance.state = workInProgress.memoizedState;
}
var getDerivedStateFromProps = workInProgress.type.getDerivedStateFromProps;
if (typeof getDerivedStateFromProps === 'function') {
applyDerivedStateFromProps(workInProgress, getDerivedStateFromProps, props);
instance.state = workInProgress.memoizedState;
}
// In order to support react-lifecycles-compat polyfilled components,
// Unsafe lifecycles should not be invoked for components using the new APIs.
if (typeof ctor.getDerivedStateFromProps !== 'function' && typeof instance.getSnapshotBeforeUpdate !== 'function' && (typeof instance.UNSAFE_componentWillMount === 'function' || typeof instance.componentWillMount === 'function')) {
callComponentWillMount(workInProgress, instance);
// If we had additional state updates during this life-cycle, let's
// process them now.
updateQueue = workInProgress.updateQueue;
if (updateQueue !== null) {
processUpdateQueue(workInProgress, updateQueue, props, instance, renderExpirationTime);
instance.state = workInProgress.memoizedState;
}
}
if (typeof instance.componentDidMount === 'function') {
workInProgress.effectTag |= Update;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"mount() {\n this.willMount();\n this.render();\n this.didMount();\n }",
"componenetWillMount() { }",
"function runMountCallback() {\n if (!hasMountCallbackRun && currentMountCallback) {\n hasMountCallbackRun = true;\n reflow(popper);\n currentMountCallback();\n... | [
"0.69563764",
"0.676621",
"0.6732734",
"0.6719309",
"0.649951",
"0.6378189",
"0.6375986",
"0.6356537",
"0.6339795",
"0.6286211",
"0.62473047",
"0.6208389",
"0.6208389",
"0.6208389",
"0.6208389",
"0.6208389",
"0.6208389",
"0.61906123",
"0.61906123",
"0.6090201",
"0.6086474",
... | 0.0 | -1 |
Invokes the update lifecycles and returns false if it shouldn't rerender. | function updateClassInstance(current, workInProgress, renderExpirationTime) {
var ctor = workInProgress.type;
var instance = workInProgress.stateNode;
var oldProps = workInProgress.memoizedProps;
var newProps = workInProgress.pendingProps;
instance.props = oldProps;
var oldContext = instance.context;
var newUnmaskedContext = getUnmaskedContext(workInProgress);
var newContext = getMaskedContext(workInProgress, newUnmaskedContext);
var getDerivedStateFromProps = ctor.getDerivedStateFromProps;
var hasNewLifecycles = typeof getDerivedStateFromProps === 'function' || typeof instance.getSnapshotBeforeUpdate === 'function';
// Note: During these life-cycles, instance.props/instance.state are what
// ever the previously attempted to render - not the "current". However,
// during componentDidUpdate we pass the "current" props.
// In order to support react-lifecycles-compat polyfilled components,
// Unsafe lifecycles should not be invoked for components using the new APIs.
if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillReceiveProps === 'function' || typeof instance.componentWillReceiveProps === 'function')) {
if (oldProps !== newProps || oldContext !== newContext) {
callComponentWillReceiveProps(workInProgress, instance, newProps, newContext);
}
}
resetHasForceUpdateBeforeProcessing();
var oldState = workInProgress.memoizedState;
var newState = instance.state = oldState;
var updateQueue = workInProgress.updateQueue;
if (updateQueue !== null) {
processUpdateQueue(workInProgress, updateQueue, newProps, instance, renderExpirationTime);
newState = workInProgress.memoizedState;
}
if (oldProps === newProps && oldState === newState && !hasContextChanged() && !checkHasForceUpdateAfterProcessing()) {
// If an update was already in progress, we should schedule an Update
// effect even though we're bailing out, so that cWU/cDU are called.
if (typeof instance.componentDidUpdate === 'function') {
if (oldProps !== current.memoizedProps || oldState !== current.memoizedState) {
workInProgress.effectTag |= Update;
}
}
if (typeof instance.getSnapshotBeforeUpdate === 'function') {
if (oldProps !== current.memoizedProps || oldState !== current.memoizedState) {
workInProgress.effectTag |= Snapshot;
}
}
return false;
}
if (typeof getDerivedStateFromProps === 'function') {
applyDerivedStateFromProps(workInProgress, getDerivedStateFromProps, newProps);
newState = workInProgress.memoizedState;
}
var shouldUpdate = checkHasForceUpdateAfterProcessing() || checkShouldComponentUpdate(workInProgress, oldProps, newProps, oldState, newState, newContext);
if (shouldUpdate) {
// In order to support react-lifecycles-compat polyfilled components,
// Unsafe lifecycles should not be invoked for components using the new APIs.
if (!hasNewLifecycles && (typeof instance.UNSAFE_componentWillUpdate === 'function' || typeof instance.componentWillUpdate === 'function')) {
startPhaseTimer(workInProgress, 'componentWillUpdate');
if (typeof instance.componentWillUpdate === 'function') {
instance.componentWillUpdate(newProps, newState, newContext);
}
if (typeof instance.UNSAFE_componentWillUpdate === 'function') {
instance.UNSAFE_componentWillUpdate(newProps, newState, newContext);
}
stopPhaseTimer();
}
if (typeof instance.componentDidUpdate === 'function') {
workInProgress.effectTag |= Update;
}
if (typeof instance.getSnapshotBeforeUpdate === 'function') {
workInProgress.effectTag |= Snapshot;
}
} else {
// If an update was already in progress, we should schedule an Update
// effect even though we're bailing out, so that cWU/cDU are called.
if (typeof instance.componentDidUpdate === 'function') {
if (oldProps !== current.memoizedProps || oldState !== current.memoizedState) {
workInProgress.effectTag |= Update;
}
}
if (typeof instance.getSnapshotBeforeUpdate === 'function') {
if (oldProps !== current.memoizedProps || oldState !== current.memoizedState) {
workInProgress.effectTag |= Snapshot;
}
}
// If shouldComponentUpdate returned false, we should still update the
// memoized props/state to indicate that this work can be reused.
workInProgress.memoizedProps = newProps;
workInProgress.memoizedState = newState;
}
// Update the existing instance's state, props, and context pointers even
// if shouldComponentUpdate returns false.
instance.props = newProps;
instance.state = newState;
instance.context = newContext;
return shouldUpdate;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"needsUpdate() {\n // Call subclass lifecycle method\n return (\n this.internalState.needsUpdate ||\n this.hasUniformTransition() ||\n this.shouldUpdateState(this._getUpdateParams())\n );\n // End lifecycle method\n }",
"shouldComponentUpdate(next_props){\n if (!next_props.update){\... | [
"0.7417363",
"0.7368783",
"0.7323216",
"0.72973084",
"0.7290934",
"0.71080285",
"0.7068321",
"0.70315564",
"0.702067",
"0.6998804",
"0.69619256",
"0.69619256",
"0.6941111",
"0.6923462",
"0.689142",
"0.6843491",
"0.6839045",
"0.68324697",
"0.6774192",
"0.67656595",
"0.67656595... | 0.0 | -1 |
This wrapper function exists because I expect to clone the code in each path to be able to optimize each path individually by branching early. This needs a compiler or we can do it manually. Helpers that don't need this branching live outside of this function. | function ChildReconciler(shouldTrackSideEffects) {
function deleteChild(returnFiber, childToDelete) {
if (!shouldTrackSideEffects) {
// Noop.
return;
}
// Deletions are added in reversed order so we add it to the front.
// At this point, the return fiber's effect list is empty except for
// deletions, so we can just append the deletion to the list. The remaining
// effects aren't added until the complete phase. Once we implement
// resuming, this may not be true.
var last = returnFiber.lastEffect;
if (last !== null) {
last.nextEffect = childToDelete;
returnFiber.lastEffect = childToDelete;
} else {
returnFiber.firstEffect = returnFiber.lastEffect = childToDelete;
}
childToDelete.nextEffect = null;
childToDelete.effectTag = Deletion;
}
function deleteRemainingChildren(returnFiber, currentFirstChild) {
if (!shouldTrackSideEffects) {
// Noop.
return null;
}
// TODO: For the shouldClone case, this could be micro-optimized a bit by
// assuming that after the first child we've already added everything.
var childToDelete = currentFirstChild;
while (childToDelete !== null) {
deleteChild(returnFiber, childToDelete);
childToDelete = childToDelete.sibling;
}
return null;
}
function mapRemainingChildren(returnFiber, currentFirstChild) {
// Add the remaining children to a temporary map so that we can find them by
// keys quickly. Implicit (null) keys get added to this set with their index
var existingChildren = new Map();
var existingChild = currentFirstChild;
while (existingChild !== null) {
if (existingChild.key !== null) {
existingChildren.set(existingChild.key, existingChild);
} else {
existingChildren.set(existingChild.index, existingChild);
}
existingChild = existingChild.sibling;
}
return existingChildren;
}
function useFiber(fiber, pendingProps, expirationTime) {
// We currently set sibling to null and index to 0 here because it is easy
// to forget to do before returning it. E.g. for the single child case.
var clone = createWorkInProgress(fiber, pendingProps, expirationTime);
clone.index = 0;
clone.sibling = null;
return clone;
}
function placeChild(newFiber, lastPlacedIndex, newIndex) {
newFiber.index = newIndex;
if (!shouldTrackSideEffects) {
// Noop.
return lastPlacedIndex;
}
var current = newFiber.alternate;
if (current !== null) {
var oldIndex = current.index;
if (oldIndex < lastPlacedIndex) {
// This is a move.
newFiber.effectTag = Placement;
return lastPlacedIndex;
} else {
// This item can stay in place.
return oldIndex;
}
} else {
// This is an insertion.
newFiber.effectTag = Placement;
return lastPlacedIndex;
}
}
function placeSingleChild(newFiber) {
// This is simpler for the single child case. We only need to do a
// placement for inserting new children.
if (shouldTrackSideEffects && newFiber.alternate === null) {
newFiber.effectTag = Placement;
}
return newFiber;
}
function updateTextNode(returnFiber, current, textContent, expirationTime) {
if (current === null || current.tag !== HostText) {
// Insert
var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);
created.return = returnFiber;
return created;
} else {
// Update
var existing = useFiber(current, textContent, expirationTime);
existing.return = returnFiber;
return existing;
}
}
function updateElement(returnFiber, current, element, expirationTime) {
if (current !== null && current.type === element.type) {
// Move based on index
var existing = useFiber(current, element.props, expirationTime);
existing.ref = coerceRef(returnFiber, current, element);
existing.return = returnFiber;
{
existing._debugSource = element._source;
existing._debugOwner = element._owner;
}
return existing;
} else {
// Insert
var created = createFiberFromElement(element, returnFiber.mode, expirationTime);
created.ref = coerceRef(returnFiber, current, element);
created.return = returnFiber;
return created;
}
}
function updatePortal(returnFiber, current, portal, expirationTime) {
if (current === null || current.tag !== HostPortal || current.stateNode.containerInfo !== portal.containerInfo || current.stateNode.implementation !== portal.implementation) {
// Insert
var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);
created.return = returnFiber;
return created;
} else {
// Update
var existing = useFiber(current, portal.children || [], expirationTime);
existing.return = returnFiber;
return existing;
}
}
function updateFragment(returnFiber, current, fragment, expirationTime, key) {
if (current === null || current.tag !== Fragment) {
// Insert
var created = createFiberFromFragment(fragment, returnFiber.mode, expirationTime, key);
created.return = returnFiber;
return created;
} else {
// Update
var existing = useFiber(current, fragment, expirationTime);
existing.return = returnFiber;
return existing;
}
}
function createChild(returnFiber, newChild, expirationTime) {
if (typeof newChild === 'string' || typeof newChild === 'number') {
// Text nodes don't have keys. If the previous node is implicitly keyed
// we can continue to replace it without aborting even if it is not a text
// node.
var created = createFiberFromText('' + newChild, returnFiber.mode, expirationTime);
created.return = returnFiber;
return created;
}
if (typeof newChild === 'object' && newChild !== null) {
switch (newChild.$$typeof) {
case REACT_ELEMENT_TYPE:
{
var _created = createFiberFromElement(newChild, returnFiber.mode, expirationTime);
_created.ref = coerceRef(returnFiber, null, newChild);
_created.return = returnFiber;
return _created;
}
case REACT_PORTAL_TYPE:
{
var _created2 = createFiberFromPortal(newChild, returnFiber.mode, expirationTime);
_created2.return = returnFiber;
return _created2;
}
}
if (isArray$1(newChild) || getIteratorFn(newChild)) {
var _created3 = createFiberFromFragment(newChild, returnFiber.mode, expirationTime, null);
_created3.return = returnFiber;
return _created3;
}
throwOnInvalidObjectType(returnFiber, newChild);
}
{
if (typeof newChild === 'function') {
warnOnFunctionType();
}
}
return null;
}
function updateSlot(returnFiber, oldFiber, newChild, expirationTime) {
// Update the fiber if the keys match, otherwise return null.
var key = oldFiber !== null ? oldFiber.key : null;
if (typeof newChild === 'string' || typeof newChild === 'number') {
// Text nodes don't have keys. If the previous node is implicitly keyed
// we can continue to replace it without aborting even if it is not a text
// node.
if (key !== null) {
return null;
}
return updateTextNode(returnFiber, oldFiber, '' + newChild, expirationTime);
}
if (typeof newChild === 'object' && newChild !== null) {
switch (newChild.$$typeof) {
case REACT_ELEMENT_TYPE:
{
if (newChild.key === key) {
if (newChild.type === REACT_FRAGMENT_TYPE) {
return updateFragment(returnFiber, oldFiber, newChild.props.children, expirationTime, key);
}
return updateElement(returnFiber, oldFiber, newChild, expirationTime);
} else {
return null;
}
}
case REACT_PORTAL_TYPE:
{
if (newChild.key === key) {
return updatePortal(returnFiber, oldFiber, newChild, expirationTime);
} else {
return null;
}
}
}
if (isArray$1(newChild) || getIteratorFn(newChild)) {
if (key !== null) {
return null;
}
return updateFragment(returnFiber, oldFiber, newChild, expirationTime, null);
}
throwOnInvalidObjectType(returnFiber, newChild);
}
{
if (typeof newChild === 'function') {
warnOnFunctionType();
}
}
return null;
}
function updateFromMap(existingChildren, returnFiber, newIdx, newChild, expirationTime) {
if (typeof newChild === 'string' || typeof newChild === 'number') {
// Text nodes don't have keys, so we neither have to check the old nor
// new node for the key. If both are text nodes, they match.
var matchedFiber = existingChildren.get(newIdx) || null;
return updateTextNode(returnFiber, matchedFiber, '' + newChild, expirationTime);
}
if (typeof newChild === 'object' && newChild !== null) {
switch (newChild.$$typeof) {
case REACT_ELEMENT_TYPE:
{
var _matchedFiber = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;
if (newChild.type === REACT_FRAGMENT_TYPE) {
return updateFragment(returnFiber, _matchedFiber, newChild.props.children, expirationTime, newChild.key);
}
return updateElement(returnFiber, _matchedFiber, newChild, expirationTime);
}
case REACT_PORTAL_TYPE:
{
var _matchedFiber2 = existingChildren.get(newChild.key === null ? newIdx : newChild.key) || null;
return updatePortal(returnFiber, _matchedFiber2, newChild, expirationTime);
}
}
if (isArray$1(newChild) || getIteratorFn(newChild)) {
var _matchedFiber3 = existingChildren.get(newIdx) || null;
return updateFragment(returnFiber, _matchedFiber3, newChild, expirationTime, null);
}
throwOnInvalidObjectType(returnFiber, newChild);
}
{
if (typeof newChild === 'function') {
warnOnFunctionType();
}
}
return null;
}
/**
* Warns if there is a duplicate or missing key
*/
function warnOnInvalidKey(child, knownKeys) {
{
if (typeof child !== 'object' || child === null) {
return knownKeys;
}
switch (child.$$typeof) {
case REACT_ELEMENT_TYPE:
case REACT_PORTAL_TYPE:
warnForMissingKey(child);
var key = child.key;
if (typeof key !== 'string') {
break;
}
if (knownKeys === null) {
knownKeys = new Set();
knownKeys.add(key);
break;
}
if (!knownKeys.has(key)) {
knownKeys.add(key);
break;
}
warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());
break;
default:
break;
}
}
return knownKeys;
}
function reconcileChildrenArray(returnFiber, currentFirstChild, newChildren, expirationTime) {
// This algorithm can't optimize by searching from boths ends since we
// don't have backpointers on fibers. I'm trying to see how far we can get
// with that model. If it ends up not being worth the tradeoffs, we can
// add it later.
// Even with a two ended optimization, we'd want to optimize for the case
// where there are few changes and brute force the comparison instead of
// going for the Map. It'd like to explore hitting that path first in
// forward-only mode and only go for the Map once we notice that we need
// lots of look ahead. This doesn't handle reversal as well as two ended
// search but that's unusual. Besides, for the two ended optimization to
// work on Iterables, we'd need to copy the whole set.
// In this first iteration, we'll just live with hitting the bad case
// (adding everything to a Map) in for every insert/move.
// If you change this code, also update reconcileChildrenIterator() which
// uses the same algorithm.
{
// First, validate keys.
var knownKeys = null;
for (var i = 0; i < newChildren.length; i++) {
var child = newChildren[i];
knownKeys = warnOnInvalidKey(child, knownKeys);
}
}
var resultingFirstChild = null;
var previousNewFiber = null;
var oldFiber = currentFirstChild;
var lastPlacedIndex = 0;
var newIdx = 0;
var nextOldFiber = null;
for (; oldFiber !== null && newIdx < newChildren.length; newIdx++) {
if (oldFiber.index > newIdx) {
nextOldFiber = oldFiber;
oldFiber = null;
} else {
nextOldFiber = oldFiber.sibling;
}
var newFiber = updateSlot(returnFiber, oldFiber, newChildren[newIdx], expirationTime);
if (newFiber === null) {
// TODO: This breaks on empty slots like null children. That's
// unfortunate because it triggers the slow path all the time. We need
// a better way to communicate whether this was a miss or null,
// boolean, undefined, etc.
if (oldFiber === null) {
oldFiber = nextOldFiber;
}
break;
}
if (shouldTrackSideEffects) {
if (oldFiber && newFiber.alternate === null) {
// We matched the slot, but we didn't reuse the existing fiber, so we
// need to delete the existing child.
deleteChild(returnFiber, oldFiber);
}
}
lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);
if (previousNewFiber === null) {
// TODO: Move out of the loop. This only happens for the first run.
resultingFirstChild = newFiber;
} else {
// TODO: Defer siblings if we're not at the right index for this slot.
// I.e. if we had null values before, then we want to defer this
// for each null value. However, we also don't want to call updateSlot
// with the previous one.
previousNewFiber.sibling = newFiber;
}
previousNewFiber = newFiber;
oldFiber = nextOldFiber;
}
if (newIdx === newChildren.length) {
// We've reached the end of the new children. We can delete the rest.
deleteRemainingChildren(returnFiber, oldFiber);
return resultingFirstChild;
}
if (oldFiber === null) {
// If we don't have any more existing children we can choose a fast path
// since the rest will all be insertions.
for (; newIdx < newChildren.length; newIdx++) {
var _newFiber = createChild(returnFiber, newChildren[newIdx], expirationTime);
if (!_newFiber) {
continue;
}
lastPlacedIndex = placeChild(_newFiber, lastPlacedIndex, newIdx);
if (previousNewFiber === null) {
// TODO: Move out of the loop. This only happens for the first run.
resultingFirstChild = _newFiber;
} else {
previousNewFiber.sibling = _newFiber;
}
previousNewFiber = _newFiber;
}
return resultingFirstChild;
}
// Add all children to a key map for quick lookups.
var existingChildren = mapRemainingChildren(returnFiber, oldFiber);
// Keep scanning and use the map to restore deleted items as moves.
for (; newIdx < newChildren.length; newIdx++) {
var _newFiber2 = updateFromMap(existingChildren, returnFiber, newIdx, newChildren[newIdx], expirationTime);
if (_newFiber2) {
if (shouldTrackSideEffects) {
if (_newFiber2.alternate !== null) {
// The new fiber is a work in progress, but if there exists a
// current, that means that we reused the fiber. We need to delete
// it from the child list so that we don't add it to the deletion
// list.
existingChildren.delete(_newFiber2.key === null ? newIdx : _newFiber2.key);
}
}
lastPlacedIndex = placeChild(_newFiber2, lastPlacedIndex, newIdx);
if (previousNewFiber === null) {
resultingFirstChild = _newFiber2;
} else {
previousNewFiber.sibling = _newFiber2;
}
previousNewFiber = _newFiber2;
}
}
if (shouldTrackSideEffects) {
// Any existing children that weren't consumed above were deleted. We need
// to add them to the deletion list.
existingChildren.forEach(function (child) {
return deleteChild(returnFiber, child);
});
}
return resultingFirstChild;
}
function reconcileChildrenIterator(returnFiber, currentFirstChild, newChildrenIterable, expirationTime) {
// This is the same implementation as reconcileChildrenArray(),
// but using the iterator instead.
var iteratorFn = getIteratorFn(newChildrenIterable);
!(typeof iteratorFn === 'function') ? invariant(false, 'An object is not an iterable. This error is likely caused by a bug in React. Please file an issue.') : void 0;
{
// Warn about using Maps as children
if (newChildrenIterable.entries === iteratorFn) {
!didWarnAboutMaps ? warning(false, 'Using Maps as children is unsupported and will likely yield ' + 'unexpected results. Convert it to a sequence/iterable of keyed ' + 'ReactElements instead.%s', getCurrentFiberStackAddendum$7()) : void 0;
didWarnAboutMaps = true;
}
// First, validate keys.
// We'll get a different iterator later for the main pass.
var _newChildren = iteratorFn.call(newChildrenIterable);
if (_newChildren) {
var knownKeys = null;
var _step = _newChildren.next();
for (; !_step.done; _step = _newChildren.next()) {
var child = _step.value;
knownKeys = warnOnInvalidKey(child, knownKeys);
}
}
}
var newChildren = iteratorFn.call(newChildrenIterable);
!(newChildren != null) ? invariant(false, 'An iterable object provided no iterator.') : void 0;
var resultingFirstChild = null;
var previousNewFiber = null;
var oldFiber = currentFirstChild;
var lastPlacedIndex = 0;
var newIdx = 0;
var nextOldFiber = null;
var step = newChildren.next();
for (; oldFiber !== null && !step.done; newIdx++, step = newChildren.next()) {
if (oldFiber.index > newIdx) {
nextOldFiber = oldFiber;
oldFiber = null;
} else {
nextOldFiber = oldFiber.sibling;
}
var newFiber = updateSlot(returnFiber, oldFiber, step.value, expirationTime);
if (newFiber === null) {
// TODO: This breaks on empty slots like null children. That's
// unfortunate because it triggers the slow path all the time. We need
// a better way to communicate whether this was a miss or null,
// boolean, undefined, etc.
if (!oldFiber) {
oldFiber = nextOldFiber;
}
break;
}
if (shouldTrackSideEffects) {
if (oldFiber && newFiber.alternate === null) {
// We matched the slot, but we didn't reuse the existing fiber, so we
// need to delete the existing child.
deleteChild(returnFiber, oldFiber);
}
}
lastPlacedIndex = placeChild(newFiber, lastPlacedIndex, newIdx);
if (previousNewFiber === null) {
// TODO: Move out of the loop. This only happens for the first run.
resultingFirstChild = newFiber;
} else {
// TODO: Defer siblings if we're not at the right index for this slot.
// I.e. if we had null values before, then we want to defer this
// for each null value. However, we also don't want to call updateSlot
// with the previous one.
previousNewFiber.sibling = newFiber;
}
previousNewFiber = newFiber;
oldFiber = nextOldFiber;
}
if (step.done) {
// We've reached the end of the new children. We can delete the rest.
deleteRemainingChildren(returnFiber, oldFiber);
return resultingFirstChild;
}
if (oldFiber === null) {
// If we don't have any more existing children we can choose a fast path
// since the rest will all be insertions.
for (; !step.done; newIdx++, step = newChildren.next()) {
var _newFiber3 = createChild(returnFiber, step.value, expirationTime);
if (_newFiber3 === null) {
continue;
}
lastPlacedIndex = placeChild(_newFiber3, lastPlacedIndex, newIdx);
if (previousNewFiber === null) {
// TODO: Move out of the loop. This only happens for the first run.
resultingFirstChild = _newFiber3;
} else {
previousNewFiber.sibling = _newFiber3;
}
previousNewFiber = _newFiber3;
}
return resultingFirstChild;
}
// Add all children to a key map for quick lookups.
var existingChildren = mapRemainingChildren(returnFiber, oldFiber);
// Keep scanning and use the map to restore deleted items as moves.
for (; !step.done; newIdx++, step = newChildren.next()) {
var _newFiber4 = updateFromMap(existingChildren, returnFiber, newIdx, step.value, expirationTime);
if (_newFiber4 !== null) {
if (shouldTrackSideEffects) {
if (_newFiber4.alternate !== null) {
// The new fiber is a work in progress, but if there exists a
// current, that means that we reused the fiber. We need to delete
// it from the child list so that we don't add it to the deletion
// list.
existingChildren.delete(_newFiber4.key === null ? newIdx : _newFiber4.key);
}
}
lastPlacedIndex = placeChild(_newFiber4, lastPlacedIndex, newIdx);
if (previousNewFiber === null) {
resultingFirstChild = _newFiber4;
} else {
previousNewFiber.sibling = _newFiber4;
}
previousNewFiber = _newFiber4;
}
}
if (shouldTrackSideEffects) {
// Any existing children that weren't consumed above were deleted. We need
// to add them to the deletion list.
existingChildren.forEach(function (child) {
return deleteChild(returnFiber, child);
});
}
return resultingFirstChild;
}
function reconcileSingleTextNode(returnFiber, currentFirstChild, textContent, expirationTime) {
// There's no need to check for keys on text nodes since we don't have a
// way to define them.
if (currentFirstChild !== null && currentFirstChild.tag === HostText) {
// We already have an existing node so let's just update it and delete
// the rest.
deleteRemainingChildren(returnFiber, currentFirstChild.sibling);
var existing = useFiber(currentFirstChild, textContent, expirationTime);
existing.return = returnFiber;
return existing;
}
// The existing first child is not a text node so we need to create one
// and delete the existing ones.
deleteRemainingChildren(returnFiber, currentFirstChild);
var created = createFiberFromText(textContent, returnFiber.mode, expirationTime);
created.return = returnFiber;
return created;
}
function reconcileSingleElement(returnFiber, currentFirstChild, element, expirationTime) {
var key = element.key;
var child = currentFirstChild;
while (child !== null) {
// TODO: If key === null and child.key === null, then this only applies to
// the first item in the list.
if (child.key === key) {
if (child.tag === Fragment ? element.type === REACT_FRAGMENT_TYPE : child.type === element.type) {
deleteRemainingChildren(returnFiber, child.sibling);
var existing = useFiber(child, element.type === REACT_FRAGMENT_TYPE ? element.props.children : element.props, expirationTime);
existing.ref = coerceRef(returnFiber, child, element);
existing.return = returnFiber;
{
existing._debugSource = element._source;
existing._debugOwner = element._owner;
}
return existing;
} else {
deleteRemainingChildren(returnFiber, child);
break;
}
} else {
deleteChild(returnFiber, child);
}
child = child.sibling;
}
if (element.type === REACT_FRAGMENT_TYPE) {
var created = createFiberFromFragment(element.props.children, returnFiber.mode, expirationTime, element.key);
created.return = returnFiber;
return created;
} else {
var _created4 = createFiberFromElement(element, returnFiber.mode, expirationTime);
_created4.ref = coerceRef(returnFiber, currentFirstChild, element);
_created4.return = returnFiber;
return _created4;
}
}
function reconcileSinglePortal(returnFiber, currentFirstChild, portal, expirationTime) {
var key = portal.key;
var child = currentFirstChild;
while (child !== null) {
// TODO: If key === null and child.key === null, then this only applies to
// the first item in the list.
if (child.key === key) {
if (child.tag === HostPortal && child.stateNode.containerInfo === portal.containerInfo && child.stateNode.implementation === portal.implementation) {
deleteRemainingChildren(returnFiber, child.sibling);
var existing = useFiber(child, portal.children || [], expirationTime);
existing.return = returnFiber;
return existing;
} else {
deleteRemainingChildren(returnFiber, child);
break;
}
} else {
deleteChild(returnFiber, child);
}
child = child.sibling;
}
var created = createFiberFromPortal(portal, returnFiber.mode, expirationTime);
created.return = returnFiber;
return created;
}
// This API will tag the children with the side-effect of the reconciliation
// itself. They will be added to the side-effect list as we pass through the
// children and the parent.
function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {
// This function is not recursive.
// If the top level item is an array, we treat it as a set of children,
// not as a fragment. Nested arrays on the other hand will be treated as
// fragment nodes. Recursion happens at the normal flow.
// Handle top level unkeyed fragments as if they were arrays.
// This leads to an ambiguity between <>{[...]}</> and <>...</>.
// We treat the ambiguous cases above the same.
var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;
if (isUnkeyedTopLevelFragment) {
newChild = newChild.props.children;
}
// Handle object types
var isObject = typeof newChild === 'object' && newChild !== null;
if (isObject) {
switch (newChild.$$typeof) {
case REACT_ELEMENT_TYPE:
return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));
case REACT_PORTAL_TYPE:
return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));
}
}
if (typeof newChild === 'string' || typeof newChild === 'number') {
return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));
}
if (isArray$1(newChild)) {
return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);
}
if (getIteratorFn(newChild)) {
return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);
}
if (isObject) {
throwOnInvalidObjectType(returnFiber, newChild);
}
{
if (typeof newChild === 'function') {
warnOnFunctionType();
}
}
if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {
// 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.
switch (returnFiber.tag) {
case ClassComponent:
{
{
var instance = returnFiber.stateNode;
if (instance.render._isMockFunction) {
// We allow auto-mocks to proceed as if they're returning null.
break;
}
}
}
// Intentionally fall through to the next case, which handles both
// functions and classes
// eslint-disable-next-lined no-fallthrough
case FunctionalComponent:
{
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');
}
}
}
// Remaining cases are all treated as empty.
return deleteRemainingChildren(returnFiber, currentFirstChild);
}
return reconcileChildFibers;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function o0(o1)\n{\n var o2 = -1;\n try {\nfor (var o259 = 0; o3 < o1.length; function (o502, name, o38, o781, o782, o837, o585, o838, o549) {\n try {\no839.o468();\n}catch(e){}\n // TODO we should allow people to just pass in a complete filename instead\n // of parent and name being tha... | [
"0.55674225",
"0.53212273",
"0.5182542",
"0.518027",
"0.5171562",
"0.51550424",
"0.51284516",
"0.5106238",
"0.5089448",
"0.508023",
"0.498055",
"0.49449962",
"0.49323848",
"0.49047467",
"0.48439628",
"0.48303586",
"0.48161054",
"0.48044205",
"0.4796409",
"0.4795924",
"0.47891... | 0.0 | -1 |
Warns if there is a duplicate or missing key | function warnOnInvalidKey(child, knownKeys) {
{
if (typeof child !== 'object' || child === null) {
return knownKeys;
}
switch (child.$$typeof) {
case REACT_ELEMENT_TYPE:
case REACT_PORTAL_TYPE:
warnForMissingKey(child);
var key = child.key;
if (typeof key !== 'string') {
break;
}
if (knownKeys === null) {
knownKeys = new Set();
knownKeys.add(key);
break;
}
if (!knownKeys.has(key)) {
knownKeys.add(key);
break;
}
warning(false, 'Encountered two children with the same key, `%s`. ' + 'Keys should be unique so that components maintain their identity ' + 'across updates. Non-unique keys may cause children to be ' + 'duplicated and/or omitted — the behavior is unsupported and ' + 'could change in a future version.%s', key, getCurrentFiberStackAddendum$7());
break;
default:
break;
}
}
return knownKeys;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"checkDuplicates(error) {\n if (error.name === \"MongoError\" && error.code === 11000) {\n // check if the error from Mongodb is duplication error\n // eslint-disable-next-line no-useless-escape\n const regex = /index\\:\\ (?:.*\\.)?\\$?(?:([_a-z0-9]*)(?:_\\d*)|([_a-z0-9]*))\\s*dup key/i;\n c... | [
"0.64586234",
"0.63743407",
"0.62774295",
"0.61566454",
"0.61478174",
"0.61425227",
"0.61372644",
"0.61251426",
"0.61251426",
"0.61219513",
"0.6114083",
"0.6114083",
"0.6114083",
"0.61133426",
"0.61059004",
"0.6096614",
"0.60936666",
"0.6082668",
"0.5989997",
"0.59782195",
"0... | 0.0 | -1 |
This API will tag the children with the sideeffect of the reconciliation itself. They will be added to the sideeffect list as we pass through the children and the parent. | function reconcileChildFibers(returnFiber, currentFirstChild, newChild, expirationTime) {
// This function is not recursive.
// If the top level item is an array, we treat it as a set of children,
// not as a fragment. Nested arrays on the other hand will be treated as
// fragment nodes. Recursion happens at the normal flow.
// Handle top level unkeyed fragments as if they were arrays.
// This leads to an ambiguity between <>{[...]}</> and <>...</>.
// We treat the ambiguous cases above the same.
var isUnkeyedTopLevelFragment = typeof newChild === 'object' && newChild !== null && newChild.type === REACT_FRAGMENT_TYPE && newChild.key === null;
if (isUnkeyedTopLevelFragment) {
newChild = newChild.props.children;
}
// Handle object types
var isObject = typeof newChild === 'object' && newChild !== null;
if (isObject) {
switch (newChild.$$typeof) {
case REACT_ELEMENT_TYPE:
return placeSingleChild(reconcileSingleElement(returnFiber, currentFirstChild, newChild, expirationTime));
case REACT_PORTAL_TYPE:
return placeSingleChild(reconcileSinglePortal(returnFiber, currentFirstChild, newChild, expirationTime));
}
}
if (typeof newChild === 'string' || typeof newChild === 'number') {
return placeSingleChild(reconcileSingleTextNode(returnFiber, currentFirstChild, '' + newChild, expirationTime));
}
if (isArray$1(newChild)) {
return reconcileChildrenArray(returnFiber, currentFirstChild, newChild, expirationTime);
}
if (getIteratorFn(newChild)) {
return reconcileChildrenIterator(returnFiber, currentFirstChild, newChild, expirationTime);
}
if (isObject) {
throwOnInvalidObjectType(returnFiber, newChild);
}
{
if (typeof newChild === 'function') {
warnOnFunctionType();
}
}
if (typeof newChild === 'undefined' && !isUnkeyedTopLevelFragment) {
// 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.
switch (returnFiber.tag) {
case ClassComponent:
{
{
var instance = returnFiber.stateNode;
if (instance.render._isMockFunction) {
// We allow auto-mocks to proceed as if they're returning null.
break;
}
}
}
// Intentionally fall through to the next case, which handles both
// functions and classes
// eslint-disable-next-lined no-fallthrough
case FunctionalComponent:
{
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');
}
}
}
// Remaining cases are all treated as empty.
return deleteRemainingChildren(returnFiber, currentFirstChild);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function ChildReconciler(shouldTrackSideEffects) {\n function deleteChild(returnFiber, childToDelete) {\n if (!shouldTrackSideEffects) // Noop.\n return;\n // Deletions are added in reversed order so we add it to the front.\n // At this point, the return fiber's ... | [
"0.69689286",
"0.6940482",
"0.6940482",
"0.6940482",
"0.6940482",
"0.6933627",
"0.6933627",
"0.6933627",
"0.6933627",
"0.6933627",
"0.6933627",
"0.6927816",
"0.6927816",
"0.6927816",
"0.6927629",
"0.6927629",
"0.6927629",
"0.6923651",
"0.6921517",
"0.69135743",
"0.6900002",
... | 0.0 | -1 |
TODO: Remove this and use reconcileChildrenAtExpirationTime directly. | function reconcileChildren(current, workInProgress, nextChildren) {
reconcileChildrenAtExpirationTime(current, workInProgress, nextChildren, workInProgress.expirationTime);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInProgress.expirationTime);}",
"function reconcileChildren(current,workInProgress,nextChildren){reconcileChildrenAtExpirationTime(current,workInProgress,nextChildren,workInPro... | [
"0.823957",
"0.823957",
"0.823957",
"0.823957",
"0.823957",
"0.78228706",
"0.77402437",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7718201",
"0.7... | 0.7481744 | 60 |
TODO: Delete memoizeProps/State and move to reconcile/bailout instead | function memoizeProps(workInProgress, nextProps) {
workInProgress.memoizedProps = nextProps;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function memoizeProps(workInProgress, nextProps) {\n\t workInProgress.memoizedProps = nextProps;\n\t }",
"function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = nextProps;\n }",
"function memoizeProps(workInProgress, nextProps) {\n workInProgress.memoizedProps = ... | [
"0.67638755",
"0.6755903",
"0.6748187",
"0.6748187",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
"0.6717509",
... | 0.6671089 | 67 |
This module is forked in different environments. By default, return `true` to log errors to the console. Forks can return `false` if this isn't desirable. | function showErrorDialog(capturedError) {
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"static runningOnNode ()\n\t\t{ let ud = \"undefined\";\n\n\t\t\tif (typeof process === ud)\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (! process )\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (! process.versions )\n\t\t\t{ return false;\n\t\t\t}\n\t\t\tif (! process.versions.node )\n\t\t\t{ return false;\n\t\t\t}\n\t\... | [
"0.6476742",
"0.59491473",
"0.584118",
"0.5588432",
"0.5582435",
"0.54698336",
"0.54398966",
"0.5429671",
"0.5409681",
"0.5409681",
"0.5398092",
"0.5377223",
"0.53769946",
"0.5359536",
"0.5359536",
"0.53345436",
"0.52284026",
"0.5201319",
"0.5185094",
"0.51222306",
"0.5118625... | 0.0 | -1 |
Capture errors so they don't interrupt unmounting. | function safelyCallComponentWillUnmount(current, instance) {
{
invokeGuardedCallback$3(null, callComponentWillUnmountWithTimer, null, current, instance);
if (hasCaughtError$1()) {
var unmountError = clearCaughtError$1();
captureCommitPhaseError(current, unmountError);
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"simulateUnmount() {\n this.volumeUnmountListener(this.volumeInfo_.volumeId);\n }",
"function onerror(er){debug('onerror',er);unpipe();dest.removeListener('error',onerror);if(EElistenerCount(dest,'error')===0)errorOrDestroy(dest,er);}// Make sure our error handler is attached before userland ones.",
"functi... | [
"0.6385105",
"0.5921357",
"0.5853079",
"0.5853079",
"0.5853079",
"0.58470565",
"0.58197415",
"0.58197415",
"0.58197415",
"0.57672554",
"0.5742686",
"0.5742686",
"0.5742686",
"0.5742686",
"0.5742686",
"0.57321393",
"0.57321393",
"0.57321393",
"0.5689659",
"0.5689659",
"0.56572... | 0.0 | -1 |
Useroriginating errors (lifecycles and refs) should not interrupt deletion, so don't let them throw. Hostoriginating errors should interrupt deletion, so it's okay | function commitUnmount(current) {
if (typeof onCommitUnmount === 'function') {
onCommitUnmount(current);
}
switch (current.tag) {
case ClassComponent:
{
safelyDetachRef(current);
var instance = current.stateNode;
if (typeof instance.componentWillUnmount === 'function') {
safelyCallComponentWillUnmount(current, instance);
}
return;
}
case HostComponent:
{
safelyDetachRef(current);
return;
}
case HostPortal:
{
// TODO: this is recursive.
// We are also not using this parent because
// the portal will get pushed immediately.
if (supportsMutation) {
unmountHostComponents(current);
} else if (supportsPersistence) {
emptyPortalContainer(current);
}
return;
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"detach() {\n throw new Error('Not Implemented');\n }",
"detach() {\n throw new Error('Not Implemented');\n }",
"function deleteErrHandler(error, result) {\n\tif (error) {\n\t\tlog(\"cannot delete data\")\n\t\tthrow error\n\t} else {\n\t\tlog(\"Delete Success\") \n\t}\n}",
"componentWillUnmount() {\n ... | [
"0.60742086",
"0.60742086",
"0.59141797",
"0.59037095",
"0.58821017",
"0.58274007",
"0.58048403",
"0.5790703",
"0.57566315",
"0.57082933",
"0.56811607",
"0.5672898",
"0.56346536",
"0.56346536",
"0.5631592",
"0.5605371",
"0.55458134",
"0.55373806",
"0.55373806",
"0.55373806",
... | 0.0 | -1 |
Creates a unique async expiration time. | function computeUniqueAsyncExpiration() {
var currentTime = recalculateCurrentTime();
var result = computeAsyncExpiration(currentTime);
if (result <= lastUniqueAsyncExpiration) {
// Since we assume the current time monotonically increases, we only hit
// this branch when computeUniqueAsyncExpiration is fired multiple times
// within a 200ms window (or whatever the async bucket size is).
result = lastUniqueAsyncExpiration + 1;
}
lastUniqueAsyncExpiration = result;
return lastUniqueAsyncExpiration;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function computeUniqueAsyncExpiration() {\n var currentTime = requestCurrentTime();\n var result = computeAsyncExpiration(currentTime);\n if (result <= lastUniqueAsyncExpiration) {\n // Since we assume the current time monotonically increases, we only hit\n // this branch when computeUniqueAsyncExpiration... | [
"0.680362",
"0.680362",
"0.680362",
"0.680362",
"0.680362",
"0.680362",
"0.680362",
"0.680362",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026",
"0.67935026"... | 0.6765476 | 42 |
TODO: Rename this to scheduleTimeout or something | function suspendRoot(root, thenable, timeoutMs, suspendedTime) {
// Schedule the timeout.
if (timeoutMs >= 0 && nextLatestTimeoutMs < timeoutMs) {
nextLatestTimeoutMs = timeoutMs;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"schedule(delay = this.timeout) {\r\n this.cancel();\r\n this.timeoutToken = setTimeout(this.timeoutHandler, delay);\r\n }",
"function setupTimeoutTimer() {\n updateTimeoutInfo(undefined);\n }",
"onTimeout() {}",
"async setTimeout() {\n const TimeoutRequestsWindowTime = 5*60*1000;\n ... | [
"0.7186767",
"0.6903256",
"0.6726437",
"0.642659",
"0.64253235",
"0.6383911",
"0.62639284",
"0.6259933",
"0.62280244",
"0.6226642",
"0.6201523",
"0.6201523",
"0.617181",
"0.61546135",
"0.61085117",
"0.6095036",
"0.60944223",
"0.60881335",
"0.60881335",
"0.6076965",
"0.6067652... | 0.0 | -1 |
requestWork is called by the scheduler whenever a root receives an update. It's up to the renderer to call renderRoot at some point in the future. | function requestWork(root, expirationTime) {
addRootToSchedule(root, expirationTime);
if (isRendering) {
// Prevent reentrancy. Remaining work will be scheduled at the end of
// the currently rendering batch.
return;
}
if (isBatchingUpdates) {
// Flush work at the end of the batch.
if (isUnbatchingUpdates) {
// ...unless we're inside unbatchedUpdates, in which case we should
// flush it now.
nextFlushedRoot = root;
nextFlushedExpirationTime = Sync;
performWorkOnRoot(root, Sync, false);
}
return;
}
// TODO: Get rid of Sync and use current time?
if (expirationTime === Sync) {
performSyncWork();
} else {
scheduleCallbackWithExpiration(expirationTime);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Remaining work will be scheduled at the end of\n// the currently rendering batch.\nreturn;}if(isBatchingUpdates){// Flush work at the end of the batch.\nif(isUnbatchingUpdates){// ...unless we're... | [
"0.7653651",
"0.7653651",
"0.7631918",
"0.7631918",
"0.7631918",
"0.7145129",
"0.7145129",
"0.7145129",
"0.7100897",
"0.70825034",
"0.70758003",
"0.70758003",
"0.70758003",
"0.70758003",
"0.70758003",
"0.70758003",
"0.70758003",
"0.70758003",
"0.70758003",
"0.70758003",
"0.70... | 0.7050717 | 33 |
When working on async work, the reconciler asks the renderer if it should yield execution. For DOM, we implement this with requestIdleCallback. | function shouldYield() {
if (deadline === null) {
return false;
}
if (deadline.timeRemaining() > timeHeuristicForUnitOfWork) {
// Disregard deadline.didTimeout. Only expired work should be flushed
// during a timeout. This path is only hit for non-expired work.
return false;
}
deadlineDidExpire = true;
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"onIdle (callback) {\n\t\tif (Object.keys (this.taskMap).length <= 0) {\n\t\t\tsetImmediate (callback);\n\t\t\treturn;\n\t\t}\n\t\tthis.statusEventEmitter.once (IdleEvent, callback);\n\t}",
"function requestWork(root,expirationTime){addRootToSchedule(root,expirationTime);if(isRendering){// Prevent reentrancy. Rem... | [
"0.55923533",
"0.5583884",
"0.5583884",
"0.5555731",
"0.5555731",
"0.5555731",
"0.55458957",
"0.5499496",
"0.5457743",
"0.5456889",
"0.54464793",
"0.54464793",
"0.54398525",
"0.5432785",
"0.54193616",
"0.5402261",
"0.53944165",
"0.5393767",
"0.537789",
"0.5373993",
"0.5372762... | 0.0 | -1 |
TODO: Batching should be implemented at the renderer level, not inside the reconciler. | function batchedUpdates$1(fn, a) {
var previousIsBatchingUpdates = isBatchingUpdates;
isBatchingUpdates = true;
try {
return fn(a);
} finally {
isBatchingUpdates = previousIsBatchingUpdates;
if (!isBatchingUpdates && !isRendering) {
performSyncWork();
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"updateBatches() {\n if (this.dirty === this.cacheDirty) {\n return;\n }\n if (this.graphicsData.length === 0) {\n return;\n }\n if (this.dirty !== this.cacheDirty) {\n for (var i = 0; i < this.graphicsData.length; i++) {\n var data ... | [
"0.66131675",
"0.6574288",
"0.65535474",
"0.65384126",
"0.65384126",
"0.6136533",
"0.6087616",
"0.6049396",
"0.6025469",
"0.5977921",
"0.5929122",
"0.5929122",
"0.5929122",
"0.5929122",
"0.5929122",
"0.5929122",
"0.5929122",
"0.5929122",
"0.5929122",
"0.588165",
"0.5860314",
... | 0.0 | -1 |
TODO: Batching should be implemented at the renderer level, not inside the reconciler. | function unbatchedUpdates(fn, a) {
if (isBatchingUpdates && !isUnbatchingUpdates) {
isUnbatchingUpdates = true;
try {
return fn(a);
} finally {
isUnbatchingUpdates = false;
}
}
return fn(a);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"updateBatches() {\n if (this.dirty === this.cacheDirty) {\n return;\n }\n if (this.graphicsData.length === 0) {\n return;\n }\n if (this.dirty !== this.cacheDirty) {\n for (var i = 0; i < this.graphicsData.length; i++) {\n var data ... | [
"0.66125363",
"0.6573637",
"0.65539813",
"0.6537788",
"0.6537788",
"0.61356914",
"0.60868585",
"0.60497123",
"0.6024147",
"0.5976598",
"0.59277225",
"0.59277225",
"0.59277225",
"0.59277225",
"0.59277225",
"0.59277225",
"0.59277225",
"0.59277225",
"0.59277225",
"0.58802736",
"... | 0.0 | -1 |
TODO: Batching should be implemented at the renderer level, not within the reconciler. | function flushSync(fn, a) {
!!isRendering ? invariant(false, 'flushSync was called from inside a lifecycle method. It cannot be called when React is already rendering.') : void 0;
var previousIsBatchingUpdates = isBatchingUpdates;
isBatchingUpdates = true;
try {
return syncUpdates(fn, a);
} finally {
isBatchingUpdates = previousIsBatchingUpdates;
performSyncWork();
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"updateBatches() {\n if (this.dirty === this.cacheDirty) {\n return;\n }\n if (this.graphicsData.length === 0) {\n return;\n }\n if (this.dirty !== this.cacheDirty) {\n for (var i = 0; i < this.graphicsData.length; i++) {\n var data ... | [
"0.6657742",
"0.661365",
"0.66131127",
"0.6544255",
"0.6544255",
"0.6123046",
"0.61036193",
"0.6044233",
"0.60355705",
"0.5957277",
"0.59142876",
"0.59142876",
"0.59142876",
"0.59142876",
"0.59142876",
"0.59142876",
"0.59142876",
"0.59142876",
"0.59142876",
"0.58709645",
"0.5... | 0.0 | -1 |
Base class helpers for the updating state of a component. | function Component(props, context, updater) {
this.props = props;
this.context = context;
this.refs = emptyObject;
// We initialize the default updater but the real one gets injected by the
// renderer.
this.updater = updater || ReactNoopUpdateQueue;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"update() {\n BaseState.update.call(this);\n }",
"_update() {\n // Call subclass lifecycle method\n const stateNeedsUpdate = this.needsUpdate();\n // End lifecycle method\n debug(TRACE_UPDATE, this, stateNeedsUpdate);\n\n if (stateNeedsUpdate) {\n this._updateState();\n }\n }",
"func... | [
"0.7217204",
"0.67610246",
"0.66769236",
"0.66106635",
"0.6540022",
"0.65259355",
"0.6489663",
"0.64705694",
"0.645821",
"0.63847154",
"0.6354757",
"0.63347685",
"0.63053316",
"0.6304944",
"0.62717897",
"0.6266675",
"0.621649",
"0.6214279",
"0.6194085",
"0.6189877",
"0.615812... | 0.0 | -1 |
Convenience component with default shallow equality check for sCU. | function PureComponent(props, context, updater) {
this.props = props;
this.context = context;
this.refs = emptyObject;
this.updater = updater || ReactNoopUpdateQueue;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function useStrictEquality(b, a) {\n return a === b;\n }",
"get shallowCopy() {\n return this.shallowCopy$();\n }",
"function defaultEqualityCheck(a, b) {\n return !a && !b || a === b;\n }",
"equals() {\n return false;\n }",
"equals() {\n return false;\n }",
... | [
"0.6083551",
"0.579784",
"0.5669391",
"0.56581414",
"0.56581414",
"0.5631642",
"0.55893344",
"0.55893344",
"0.55851346",
"0.5546245",
"0.548746",
"0.5484109",
"0.5481716",
"0.5481716",
"0.54722977",
"0.54722977",
"0.54722977",
"0.5451884",
"0.5451884",
"0.5441116",
"0.5398943... | 0.0 | -1 |
an immutable object with a single mutable value | function createRef() {
var refObject = {
current: null
};
{
Object.seal(refObject);
}
return refObject;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function immutableObjectTest(){\n\nlet test= {'name': 'vishal', 'age':27};\n//Object.freeze(test);\nlet test2= test;\n\ntest.age = 26;\nconsole.log(test);\nconsole.log(test2);\nconsole.log(test === test2);\n\n\n\n\n}",
"static set one(value) {}",
"function makeImmutableObject(obj) {\n\t if (!globalConfig.us... | [
"0.6674448",
"0.66609514",
"0.6358345",
"0.6347869",
"0.6347869",
"0.6263268",
"0.6230736",
"0.6136926",
"0.61048114",
"0.5915378",
"0.5889688",
"0.580687",
"0.5776291",
"0.5763881",
"0.57248324",
"0.56947106",
"0.566211",
"0.5636481",
"0.56181127",
"0.5606209",
"0.5606209",
... | 0.0 | -1 |
Create and return a new ReactElement of the given type. See | function createElement(type, config, children) {
var propName = void 0;
// Reserved names are extracted
var props = {};
var key = null;
var ref = null;
var self = null;
var source = null;
if (config != null) {
if (hasValidRef(config)) {
ref = config.ref;
}
if (hasValidKey(config)) {
key = '' + config.key;
}
self = config.__self === undefined ? null : config.__self;
source = config.__source === undefined ? null : config.__source;
// Remaining properties are added to a new props object
for (propName in config) {
if (hasOwnProperty.call(config, propName) && !RESERVED_PROPS.hasOwnProperty(propName)) {
props[propName] = config[propName];
}
}
}
// Children can be more than one argument, and those are transferred onto
// the newly allocated props object.
var childrenLength = arguments.length - 2;
if (childrenLength === 1) {
props.children = children;
} else if (childrenLength > 1) {
var childArray = Array(childrenLength);
for (var i = 0; i < childrenLength; i++) {
childArray[i] = arguments[i + 2];
}
{
if (Object.freeze) {
Object.freeze(childArray);
}
}
props.children = childArray;
}
// Resolve default props
if (type && type.defaultProps) {
var defaultProps = type.defaultProps;
for (propName in defaultProps) {
if (props[propName] === undefined) {
props[propName] = defaultProps[propName];
}
}
}
{
if (key || ref) {
if (typeof props.$$typeof === 'undefined' || props.$$typeof !== REACT_ELEMENT_TYPE) {
var displayName = typeof type === 'function' ? type.displayName || type.name || 'Unknown' : type;
if (key) {
defineKeyPropWarningGetter(props, displayName);
}
if (ref) {
defineRefPropWarningGetter(props, displayName);
}
}
}
}
return ReactElement(type, key, ref, self, source, ReactCurrentOwner.current, props);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"function createElement(type,config,children){var propName;// Reserved names are extracted\nvar props={};var key=null;var ref=null;var self=null;var source=null;if(config!=null){if(hasValidRef(config)){ref=config.ref;{warnIfStringRefCannotBeAutoConverted(config);}}if(hasValidKey(config)){key=''+config.key;}self=con... | [
"0.68920434",
"0.6835192",
"0.6767826",
"0.6757532",
"0.6745889",
"0.6745889",
"0.6745889",
"0.6745889",
"0.6745889",
"0.6745889",
"0.6745889",
"0.6745889",
"0.6745889",
"0.65640503",
"0.65581757",
"0.6406998",
"0.6406998",
"0.6406998",
"0.6406998",
"0.6406998",
"0.63805515",... | 0.6344786 | 65 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.